Quote:
Originally Posted by CRGreathouse
Yes. For example, the next prime after the Mersenne prime tested above is 2^61 + 15. PARI/GP proves its primality in 500 nanoseconds.
Moving to somewhat larger numbers, PARI/GP takes 150 ms to prove that 10^100 + 267 is prime. How long do you project that would take your program, assuming you networked all the computers in the world for the task?

Or the 2year 16core
proof of
2^11622415905? Note the 1 core test Fermat+Lucas test that took 37.00 seconds.