Comment by forinti
9 hours ago
If you take all 53 8 bit primes, you can use modular arithmetic with a residue base to work with numbers up to
64266330917908644872330635228106713310880186591609208114244758680898150367880703152525200743234420230
This would require 334 bits.
No comments yet
Contribute on Hacker News ↗