| Author |
Message |
|---|
streamVolunteer moderator
Project administrator
Volunteer developer
Volunteer tester
Send message
Joined: 1 Mar 14
Posts: 1022
ID: 301928
Credit: 543,195,188
RAC: 112
                        
|
|
I created a table which summarizes testing status for all Proth candidates ever tested on planned to test on PrimeGrid (K=5...9999, N=0...10M). You can find it here:
http://boincvm.proxyma.ru:30080/test4vm/public/pps_dc_status.php
The table also shows questionable areas (tested on PrpNet or in Adaptive Replication mode) which do contain invalid results and must be partially or fully double-checked to be sure that no primes were missed. The doublechecking is currently running in "LLR2 testing" subproject on "Private GFN server" (the link above).
|
|
|
Ravi FernandoProject administrator
Volunteer tester
Project scientist
Send message
Joined: 21 Mar 19
Posts: 210
ID: 1108183
Credit: 13,047,238
RAC: 6,438
              
|
|
For what it's worth, PPS-DIV tested k=19683 from n=300K to n=4M. Below that, I tested everything myself and JimB did the same; we only checked that the lists of primes matched. (And this was in 2019, so no Gerbicz check/LLR2. But it's a very small amount of work anyway.) |
|
|
rogueVolunteer developer
Send message
Joined: 8 Sep 07
Posts: 1255
ID: 12001
Credit: 18,565,548
RAC: 0
 
|
|
Egad! That is a large number of tests that need double-checking.
Fortunately most of that double-checking should be quick, but I suspect there is no active project to do that double-check. |
|
|
|
|
|
Just saw the news about Pavel Atnashev's prime! Congrats!
https://primes.utm.edu/primes/page.php?id=133721
Very exciting to find one missed as a result of adaptive replication. Probably the first of many with the smaller n values coming up soon.
I wonder how many will be found, and I wonder how many of those will be large enough for T5K. |
|
|
|
|
|
Yes, this is excellent news!
I already corrected the OEIS entry A053357.
The new Proth prime is a factor of xGF(2051864, 7, 3) = 7^(2^2051864) + 3^(2^2051864). And note that Atnashev's name already shows up one additional time on http://www.prothsearch.com/GFNfacs.html because of this (you can search the page for 2051864).
Great find. Congratulations!
It seems that (7^(2^m) + 3^(2^m))/2 is prime only for m equal to 0, 1, or 8. The last one is somewhat nice, (7^256 + 3^256)/2 (with 217 digits).
/JeppeSN |
|
|
 Crun-chi Volunteer tester
Send message
Joined: 25 Nov 09
Posts: 3183
ID: 50683
Credit: 112,554,621
RAC: 405,600
                 
|
Just saw the news about Pavel Atnashev's prime! Congrats!
https://primes.utm.edu/primes/page.php?id=133721
Very exciting to find one missed as a result of adaptive replication. Probably the first of many with the smaller n values coming up soon.
I wonder how many will be found, and I wonder how many of those will be large enough for T5K.
Can you explain what is adaptive replication?
____________
92*10^1439761-1 NEAR-REPDIGIT PRIME :) :) :)
4 * 650^498101-1 CRUS PRIME
2022202116^131072+1 GENERALIZED FERMAT
Proud member of team Aggie The Pew. Go Aggie! |
|
|
|
|
Just saw the news about Pavel Atnashev's prime! Congrats!
https://primes.utm.edu/primes/page.php?id=133721
Very exciting to find one missed as a result of adaptive replication. Probably the first of many with the smaller n values coming up soon.
I wonder how many will be found, and I wonder how many of those will be large enough for T5K.
Can you explain what is adaptive replication?
Many years ago PrimeGrid would not double check work from hosts that were deemed to be reputable enough.
____________
 |
|
|
