zlacker

>>tromp+(OP)
IEEE754 64-bit representation already has infinity:

    uint64_t x = 0x7ff0000000000000ULL;
    printf("%f\n", *(double *)&x);

output:

    inf

But you could use a representation where 0 is 0, and 1 is infinity, saving 63 bits...

>>matja+5c6
I don't consider infinity to be a number though. Especially not in a largest number contest.

>>tromp+0d6
Let 0 correspond to zero, and 1 corresponded to Rayo's number. Crisis averted!

>>lowq+js6
I find Loader's number [1] more interesting, as it is actually computable, yet far far larger than other famous computable numbers, like Friedman's TREE(3) or SCG(3). I'm looking forward to one day programming it in the lambda calculus, and seeing how much smaller than the existing ~500 bytes of C-code it can be.

[1] https://www.youtube.com/watch?v=q6Etl4oGL4U&list=PL-R4p-BRL8...