While this approach may have practical uses, the "sufficiently large numbers" bound got me reading about Galactic Algorithms...
>This means it will not reach its stated efficiency until the numbers have at least 2^1729^12 bits (at least 10^10^38 digits), which is vastly larger than the number of atoms in the known universe.
"Vastly larger" is one of the biggest understatements I've ever heard. It's roughly 10^10^38 times larger.
I can't think of a better way to write that line. I just found it funny.
This version might be better? If you like understatement, that is.