20081010, 22:02  #1 
"Phil"
Sep 2002
Tracktown, U.S.A.
3×373 Posts 
The probable primes
All primes up to 2^{16389}+67607 have been certified as definitely prime, either with Dario Alpern's Java applet or with Marcel Martin's Primo. The larger ones are only known to be probable primes. They were discovered in an effort to which David Broadhurst, Lars Dausch, Jim Fougeron, Richard Heylen, Sander Hoogendoorn, Marcin Lipinski, Phil Moore, Michael Porter, Mark Rodenkirch, Payam Samidoost, and Martin Schroeder all contributed. (My apologies if I have left anyone out.) The five largest were discovered by our project.
The probable primes, in order of size, are: 2^{21954}+77899 now proven prime by engracio 2^{22464}+63691 now proven prime by engracio 2^{24910}+62029 now proven prime by gd barnes 2^{25563}+22193 now proven prime by engracio 2^{26795}+57083 now proven prime by ET 2^{26827}+77783 now proven prime by engracio 2^{28978}+34429 now proven prime by Cybertronic 2^{29727}+20273 now proven prime by Cybertronic 2^{31544}+19081 now proven prime by engracio 2^{33548}+ 4471 now proven prime by Cybertronic 2^{38090}+47269 now proven prime by Cybertronic 2^{56366}+39079 now proven prime by PuzzlePeter 2^{61792}+21661 now proven prime by PuzzlePeter 2^{73360}+10711 now proven prime by PuzzlePeter 2^{73845}+14717 now proven prime by PuzzlePeter 2^{103766}+17659 2^{104095}+7013 2^{105789}+48527 2^{139964}+35461 2^{148227}+60443 2^{176177}+60947 2^{304015}+64133 2^{308809}+37967 2^{551542}+19249 2^{983620}+60451 2^{1191375}+8543 2^{1518191}+75353 2^{2249255}+28433 2^{4583176}+2131 2^{5146295}+41693 2^{9092392}+40291 (The following was in the original version of this posting, October 2008.) The first nine numbers on this list have between 6600 and 9500 digits, and could probably be proven prime using either Primo or a distributed version of ECPP. Although it is not one of the main purposes of this project, any such proof does put us a tiny step closer toward proving the dual Sierpinski conjecture. (Of course, we have no idea how to prove any of the largest numbers prime given current theory and technology.) I estimate that it would take a single processor on my 3000 MHz Pentium D system about 2 months to generate a primality certificate for either of the two smallest numbers using Primo version 2.3.2. If anyone would like to try one of these, post a reservation for a particular number below. Note that version 3.0.7 of Primo is now the preferred version, and is considerably faster than version 2.3. (It also does not need the override of the 10000 bit limit of version 3.0.6) Last fiddled with by philmoore on 20140929 at 18:03 Reason: Added the most recent proven prime! 
20081021, 20:45  #2 
Aug 2002
Ann Arbor, MI
433 Posts 
You might want to include a link to the older version of Primo. All I could come up with through google was a link to the Primo homepage, and they only have version 3.0.6 available for download.

20081021, 20:48  #3 
A Sunny Moo
Aug 2007
USA (GMT5)
6249_{10} Posts 
Yes, I second thismy friend Gary also tried to find an older version of Primo through Google and instead got a nasty virus. We definitely don't want other users picking up similar infections unnecessarily.
Last fiddled with by mdettweiler on 20081021 at 20:49 
20081021, 21:03  #4 
Undefined
"The unspeakable one"
Jun 2006
My evil lair
3×11^{2}×17 Posts 
Is there something wrong with the current version of Primo? I've got version 2.3.2. It is ~4MB zip. Not sure if this forum allows files that large, but I will try to post it here if you need it.

20081021, 21:10  #5  
A Sunny Moo
Aug 2007
USA (GMT5)
14151_{8} Posts 
Quote:
Yes, if you could please post the file, that would be greatthough, unfortunately the limit for forum attachments is way less than 4MB. If you'd like, I'd be glad to host it on the web with a Google Pages account I havejust email it to me (bugmesticky at gmail dot com) and I'll get it put up. Max Last fiddled with by philmoore on 20081201 at 02:23 Reason: The current version limit is 10,000 bits, not digits. 

20081021, 21:27  #6 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
22360_{8} Posts 
you can use either version of primo
Here's a crosspost about a feature that I didn't know about until yesterday  http://www.mersenneforum.org/showpos...5&postcount=13
So, you can use either version (up to the hardcoded limit of 50000 bits). I am not sure if Marcel is happy about this, but the cat is out of the sack now. 
20081021, 22:05  #7 
"Phil"
Sep 2002
Tracktown, U.S.A.
45F_{16} Posts 
Thanks for the note  Norman Luhn says that 3.0.6 is quite a bit faster than 2.3.2, you just have to edit the configuration file to override the 10000 bit limit:
Change [Setup] to [Setup+], and add: MBS=25000 The maximum possible limit is 50000 bits, about 15000 digits, but Norman is currently having trouble with the program at around 10000 digits. I am able to begin testing 2^21954+77899 after making the changes. You need to create an input file for the number you want to test. Look in the work folder in Primo to see formats. My estimates of the time needed to create the certificates may be too large, being based on an earlier version of Primo. 
20081021, 22:10  #8 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{4}×3×197 Posts 
The largest I ever certified was 4845digit and that was too long for my wits. Something like three weeks.

20081022, 05:41  #9 
Aug 2002
Ann Arbor, MI
1B1_{16} Posts 
How does one come up with a time estimate? I might be interested in running 2^{22464}+63691 if I had a better idea of how long it would take. I'd probably be running it on a Q6600 at stock settings (2.4ghz).

20090121, 01:46  #10 
Sep 2004
215_{16} Posts 
I'm trying the top number on a Q6600 at 3 something ghz. Its been running for 28 hrs. It says phase 1 test 5 run 2 bits 21835/21955. How close to done is it?

20090121, 02:01  #11 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2^{4}·3·197 Posts 
A month or two.
Serious. If the computer crashes or needs a reboot, it's ok  there are recovery files saved at certain reasonable time points and you will not lose much time. All you need is commitment, and the computer will do the rest. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
generalized minimal (probable) primes  sweety439  sweety439  132  20210611 16:21 
2^9092392+40291 is a probable prime!  engracio  Five or Bust  The Dual Sierpinski Problem  90  20201021 15:37 
probable largest prime.  sudaprime  Miscellaneous Math  11  20180205 08:10 
Hi, how can I test my probable prime number?  mohdosa  Information & Answers  22  20141010 11:34 
Record probable prime found!  philmoore  Five or Bust  The Dual Sierpinski Problem  18  20090128 19:47 