[QUOTE=gd_barnes;385642]Finally found a big one. From port 1400:

84363*2^2222321+1 is prime!

This is >50% larger than any prime that I have ever found. :bounce:

I just so happened to see this pop up on my main desktop machine. It has been proven prime but hasn't yet been reported to the server because it looks like it is checking to see if it is a GF factor of anything. It appears like that will take a couple of hours. I'm not exactly sure how that works.[/QUOTE]

Congrats!

For base 2 Proth primes, the client will run pfgw to find GF factors then report them to the server. It could take a while since the GF testing is done across a number of bases. Any GFs found should be reported to Wilfred Keller.

[QUOTE=rogue;385661]Congrats!

For base 2 Proth primes, the client will run pfgw to find GF factors then report them to the server. It could take a while since the GF testing is done across a number of bases. Any GFs found should be reported to Wilfred Keller.[/QUOTE]

I let it run for more than 2 hours looking for GF factors. It finished at least one test but then came this, which I noticed about 15 minutes into its next testing:

GF_sprime_3: 84363*2^2222321+1 80000/222232020

:confused: :ermm: :huh: :surprised :surrender

222232020 (!!)...That is not a typo and is not an overlay of some printing on the screen. I don't know what it is trying to test but 222M+ iterations is not a test that I wish to complete. According to my calculations, it would have taken a month to complete it. I then hit CTL-C, it returned the prime to the server, and it requested another test like I had hoped.

Any thoughts?

[QUOTE=gd_barnes;385663]GF_sprime_3: 84363*2^2222321+1 80000/222232020

:confused: :ermm: :huh: :surprised :surrender

222232020 (!!)...That is not a typo and is [B]not an overlay of some printing on the screen[/B].[/QUOTE]

Are you sure? The "2020" looks suspicious, since 2222320 is so close to 2222321. I think this is all it is. This would put the test time at ~7 hours.

[I]Of course[/I] it is an overlay. The previous stage (dubbed "GF_sprime_2") left some digits on your screen.
GF_sprime_2
GF_sprime_3
GF_sprime_5 are run for the -go test
(GF_sprime_7
GF_sprime_11 are additionally run for the -gxo test)
Exercise patience.

If you have many cores, you can run
pfgw -f0 -gos2 -q"84363*2^2222321+1"
pfgw -f0 -gos3 -q"84363*2^2222321+1"
pfgw -f0 -gos5 -q"84363*2^2222321+1"
pfgw -f0 -gos6 -q"84363*2^2222321+1"
pfgw -f0 -gos10 -q"84363*2^2222321+1"
pfgw -f0 -gos12 -q"84363*2^2222321+1"
in parallel.
For a full -gxo test, you'd need 40 cores, so it is best to leave pfgw -f0 -gxo -q"84363*2^2222321+1" run separately for a few days.

[QUOTE=Batalov;385666][I]Of course[/I] it is an overlay. The previous stage (dubbed "GF_sprime_2") left some digits on your screen.
GF_sprime_2
GF_sprime_3
GF_sprime_5 are run for the -go test
(GF_sprime_7
GF_sprime_11 are additionally run for the -gxo test)
Exercise patience.

If you have many cores, you can run
pfgw -f0 -gos2 -q"84363*2^2222321+1"
pfgw -f0 -gos3 -q"84363*2^2222321+1"
pfgw -f0 -gos5 -q"84363*2^2222321+1"
pfgw -f0 -gos6 -q"84363*2^2222321+1"
pfgw -f0 -gos10 -q"84363*2^2222321+1"
pfgw -f0 -gos12 -q"84363*2^2222321+1"
in parallel.
For a full -gxo test, you'd need 40 cores, so it is best to leave pfgw -f0 -gxo -q"84363*2^2222321+1" run separately for a few days.[/QUOTE]

I see. OK makes sense. Wow. So it would have potentially run GF factoring for several hours/days on that one core before reporting the prime to the server while that k continued to be tested?! Not good.

I'll dedicate one core and run the [ pfgw -f0 -gxo -q"84363*2^2222321+1" ] command until it finishes.

One to report here:

155877*2^2273465-1 is prime

:cool:

[URL="http://primes.utm.edu/primes/page.php?id=118820"]1344 · 73^355570 + 1[/URL] is prime and proves S73.

[QUOTE=Batalov;388464][URL="http://primes.utm.edu/primes/page.php?id=118820"]1344 · 73^355570 + 1[/URL] is prime and proves S73.[/QUOTE]

Congrats!

:bounce wave:

Nice ck (1444) eliminated also. :smile::smile:

[URL="http://primes.utm.edu/primes/page.php?id=118828"]493 · 72^480933 + 1[/URL] is prime and proves S72.

[QUOTE=Batalov;388592][URL="http://primes.utm.edu/primes/page.php?id=118828"]493 · 72^480933 + 1[/URL] is prime and proves S72.[/QUOTE]

Double wow! Proof of consecutive bases within 2 days of each other. That has to be the best since the very early days of the project.

:banana::bounce: