![]() |
|
|
#364 |
|
"Serge"
Mar 2008
San Diego, Calif.
32×7×163 Posts |
You are right - I should have looked in the .cr file again. :-)
It is indeed a backtrack. Code:
[Setup] MaxConcurrentTasks=8 SieveUpperBound=2^32 [Backtrack] Count=1 [1, backtrack:1] Type=4 Gain=3 Index=1.10120 D=-335755 H/G=96/8:12 [1] Type=4 Gain=62 Index=1.30522 D=-1904820 H/G=320/16:20 |
|
|
|
|
|
#365 |
|
Jun 2009
22·52·7 Posts |
|
|
|
|
|
|
#366 |
|
"Serge"
Mar 2008
San Diego, Calif.
32·7·163 Posts |
No, indeed, I got lucky with 1-2-3 and then backtracked. I don't think I got to 10. I can search for that folder...
The newer and newer Primo version are probably increasingly better trained for larger and larger sizes; so the later you start, the better chances are to arrive earlier. |
|
|
|
|
|
#367 |
|
Jun 2009
2BC16 Posts |
Never mind searching for the folder. I won't get near that box for several days now, so it will just run its course anyway.
Backtracking can be manipulated via the primo.ini file so I might have to do that and start once again. We'll see. |
|
|
|
|
|
#368 |
|
Jun 2009
22×52×7 Posts |
Who feels motivated to run a verification?
http://www.sendspace.com/file/hxjfvg EDIT: Marcel Martin has added new/more/better discriminants to one of his latest releases, so maybe 2^73360+10711 is doable now. I'll leave that to others though. Last fiddled with by Puzzle-Peter on 2013-12-03 at 16:26 |
|
|
|
|
|
#369 |
|
Sep 2002
Database er0rr
5·937 Posts |
Congrats for the top Primo proof of 2^73845 + 14717
![]() Pray tell us, what are the specs of the hardware used? Last fiddled with by paulunderwood on 2013-12-03 at 17:21 |
|
|
|
|
|
#370 | |
|
"Phil"
Sep 2002
Tracktown, U.S.A.
19·59 Posts |
Quote:
Congratulations, Peter, it looks like you started in May? How many cores? |
|
|
|
|
|
|
#371 |
|
Jun 2009
22·52·7 Posts |
Most of the proof was done on a dual Xeon machine with 16 threads on 16 physical cores. I found a 1:1 ratio to be the fastest.
|
|
|
|
|
|
#372 |
|
Jun 2009
22×52×7 Posts |
Just for fun I tried 2^73360+10711 once again with PRIMO 4.10. This version was successful in test1 thanks to the new discriminant tables. It will be an on-and-off job, but I will continue this run unless somebody else would rather do it.
|
|
|
|
|
|
#373 | |
|
"W. Byerly"
Aug 2013
81*2^3174353-1
7·19 Posts |
Quote:
|
|
|
|
|
|
|
#374 |
|
Jun 2009
22·52·7 Posts |
Using good hardware (16 physical cores in a dual-XEON box) it's about 3 to 4 months going 24/7. Runtime depends heavily on how much backtracking is needed, especially in the beginning when one backtrack can easily cost 2 days, so it's hard to give a precise estimate.
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| 2^9092392+40291 is a probable prime! | engracio | Five or Bust - The Dual Sierpinski Problem | 91 | 2023-03-06 21:22 |
| generalized minimal (probable) primes | sweety439 | sweety439 | 140 | 2022-12-20 07:08 |
| probable largest prime. | sudaprime | Miscellaneous Math | 11 | 2018-02-05 08:10 |
| Hi, how can I test my probable prime number? | mohdosa | Information & Answers | 22 | 2014-10-10 11:34 |
| Record probable prime found! | philmoore | Five or Bust - The Dual Sierpinski Problem | 18 | 2009-01-28 19:47 |