20220506, 21:16  #1  
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3·3,313 Posts 
FastECPP software and >50000 digit primality proof (reposted from NMBRTHRY)
Quote:
Quote:


20220506, 22:05  #2 
Sep 2002
Database er0rr
2·2,141 Posts 
An amazing feat! Such parallelism and clever mathematics run on some very big hardware. I take my hat off to these provers.

20220506, 23:17  #3 
Einyen
Dec 2003
Denmark
2^{3}×3^{2}×47 Posts 
So 71 years of CPU time for 51,000 digits vs 20 months * 64 cores ~ 107 years of CPU time for 49,081 digits.
But depends on how comparable those CPU core years are. 51,000 digits is supposed to take (51000/49081)^3.75 ~ 15% longer ? At least with Primo. 
20220506, 23:29  #4 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3×3,313 Posts 
Note in their text that they say "This <<...>> probably indicates nonoptimal choices of parameters. On the other hand, it leads to very short certificates: We reach a length of only 1645 steps" (!!).
They call it a prerelease. They will likely optimize it even more. Btw, I had to "massage" their cert a little bit, but then factorDB took it. Took 3 iterations slightly reformatting the file (and to rename it into .out file) 
20220506, 23:31  #5  
Sep 2002
Database er0rr
2×2,141 Posts 
Quote:
I used quad channel DDR 2400MHz for R49081's certification. I guess they were using octa channel most of the time, but that does not explain their speed fully. There is marginal gain by having fewer stage 2 steps to do. Last fiddled with by paulunderwood on 20220506 at 23:53 

20220506, 23:33  #6  
Sep 2002
Database er0rr
2×2,141 Posts 
Quote:
Last fiddled with by paulunderwood on 20220506 at 23:37 

20220506, 23:50  #7 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3×3,313 Posts 
I made a shorter jump and forwarded NMBRTHRY email to Caldwell. (though he is surely on the list.*)
________ * Funny story: a few years ago a ton (literally!) of porn links started coming every day via NMBRTHRY email list. It went on for quite a while. Many folks, I am afraid, unsubscribed from it at that point. Since then it has been moderated with huge delays. One curious example was when an invitation to a December conference was sent out in March. 
20220507, 00:33  #8 
Bemusing Prompter
"Danny"
Dec 2002
California
100110110000_{2} Posts 
This is great news for two reasons:
1. It's a new ECPP world record. 2. We finally have an opensource ECPP implementation that can compete with Primo. I'm aware that Marcel has no obligation to make Primo open source, but I do feel that closedsource software goes against the spirit of science. Last fiddled with by ixfd64 on 20220507 at 02:14 
20220507, 07:31  #9 
Jun 2009
1272_{8} Posts 
Holy s**t!
Hats off and congrats to all those involved. That is some serious soft and hardware. I wonder how big the code can go? There are so many interesting numbers from 50K to 100K digits. Just the electricity cost alone will make such a number pretty valuable 
20220507, 15:15  #11 
Sep 2002
Database er0rr
4282_{10} Posts 
Some entity should set up fastECPP for a proofoverthenet. Clients could latch onto the main server. This way a 60k proof might be computed in a reasonable amount of time.
Last fiddled with by paulunderwood on 20220507 at 15:22 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
For which types of primes is GPU primality test software available?  bur  GPU Computing  6  20200828 06:20 
Fastest software for Mersenne primality test?  JonathanM  Information & Answers  25  20200616 02:47 
APRCL as primality proof  f1pokerspeed  FactorDB  14  20140109 21:06 
Proof of Primality Test for Fermat Numbers  princeps  Math  15  20120402 21:49 
PRIMALITY PROOF for Wagstaff numbers!  AntonVrba  Math  96  20090225 10:37 