Re:A prime number whose binary representation looks like a g...
by YomiK on Monday January 22, 2018 @02:19PM
(#16207066)
Pari/GP's APR-CL took 4 seconds to prove it. Perl's ntheory module took 2.6 seconds to prove with ECPP (including generating and verifying a certificate). That's over 1000x slower than BPSW but still not bad.
[ Parent
| on HN ]
There are no comments on this comment yet.