User blog comment:QuasarBooster/Laver tables in Python/@comment-34422464-20181211142242/@comment-24923514-20181211143914

While the Rank-into-rank cardinal's existence is highly debated (to my understanding), the Laver table function apparently outgrows all functions that only involve ordinals or cardinals less than the Rank-into-rank cardinal. So assuming that q(n) is actually total, I've never seen a faster-growing computable function on this entire site. It's pretty neat.