User blog comment:Spitemaster/Golfing Large Numbers/@comment-32994025-20190426134739/@comment-35470197-20190426142001

If you do not mind the bytes of the programme, I would like to say thatmy array notation might be larger than Loader's number, because the OP of the SE question in the blog post states that it can be surpassed by a ZFC-analogue of Loader's number. I precisely diagonalised all provably total recursive functions in ZFC set theory, and hence it should go beyond Loader's number if the OP of the SE question is correct.