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
[/CODE]
It all makes sense now. I've always trusted that Gain meant literally a gain in bits.

[QUOTE=Batalov;325140]
If it gets to say Test 10, I can forward you the package?
.[/QUOTE]

I guess you never got to Test 10? Doesn't matter, I started it...

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.

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.

Who feels motivated to run a verification?

[URL]http://www.sendspace.com/file/hxjfvg[/URL]

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.

Congrats for the [URL="http://www.ellipsa.eu/public/primo/top20.html"]top Primo proof[/URL] of [URL="http://primes.utm.edu/primes/page.php?id=116522"]2^73845 + 14717[/URL] :bow:

Pray tell us, what are the specs of the hardware used?

[QUOTE=paulunderwood;361036]Congrats for the [URL="http://www.ellipsa.eu/public/primo/top20.html"]top Primo proof[/URL] of [URL="http://primes.utm.edu/primes/page.php?id=116522"]2^73845 + 14717[/URL] :bow:

Pray tell us, what are the specs of the hardware used?[/QUOTE]

Not just top Primo proof, but the third largest ECPP ever completed (at least on this planet.) Maybe we should rename this project "Seventeen or Bust" since we have exactly seventeen prps left to prove.

Congratulations, Peter, it looks like you started in May? How many cores?

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.

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.

[QUOTE=Puzzle-Peter;373565]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.[/QUOTE]

How long does it take to prove these numbers prime? :huh:

[QUOTE=Trilo;374685]How long does it take to prove these numbers prime? :huh:[/QUOTE]

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.