Last year I ported Loader's construction to Haskell [2] in order to better understand it, and managed to shrink the code down to under 232 bytes [1]. That work was also featured in a video that youtuber CodeParade made about the Quest To Find The Largest Number and its followup [3].<p>[1] <a href="https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/CoC.hs">https://github.com/tromp/AIT/blob/master/fast_growing_and_co...</a><p>[2] <a href="https://codegolf.stackexchange.com/questions/176966/golf-a-number-bigger-than-loaders-number/" rel="nofollow">https://codegolf.stackexchange.com/questions/176966/golf-a-n...</a><p>[3] <a href="https://www.youtube.com/watch?v=kQLcoSuMKHg&t=10s" rel="nofollow">https://www.youtube.com/watch?v=kQLcoSuMKHg&t=10s</a>