Join PrimeGrid
Returning Participants
Community
Leader Boards
Results
Other
drummers-lowrise
|
Message boards :
Project Staging Area :
Probable Prime (GFN)
Author |
Message |
|
I just figured out how to view my own PRPNet stats, and saw that I have a PRP on the GFN262144 project.
Is this PRP automatically tested somewhere for primality? Or am I supposed to do something on my own now?
____________
Proud member of Team Aggie the Pew
"Wir müssen wissen. Wir werden wissen."
"We must know, we shall know."
- David Hilbert, 1930 | |
|
|
This is odd. Your prpclient should automatically run the primality test with PFGW (assuming you have it in your package) when the PRP is found. Can you see the result of this test in your prpclient.log file?
The PRP is not listed on here : http://primes.utm.edu/top20/page.php?id=12 which suggests it was
a) proved not to be prime (unlikely)
b) proved to be prime but never submitted
c) has never been primality tested.
Please let us know if you see anything in the your log file. Otherwise you can run the deterministic test yourself using the PFGW executable.
Cheers
- Iain
____________
Twitter: IainBethune
Proud member of team "Aggie The Pew". Go Aggie!
3073428256125*2^1290000-1 is Prime! | |
|
pschoefer Volunteer developer Volunteer tester
 Send message
Joined: 20 Sep 05 Posts: 686 ID: 845 Credit: 2,910,184,413 RAC: 268,519
                              
|
This is odd. Your prpclient should automatically run the primality test with PFGW (assuming you have it in your package) when the PRP is found.
No, for GFN262144 it just reports the PRP. Changelog for PRPNet 5.0.0:
prpclient: For GFN searches, do not do primality test for n >= 262144 because PFGW requires many days to do the test and it doesn't checkpoint.
I guess that Lennart will run the primality test soon. ;)
____________
| |
|
|
This is listed as being found back in December '11, when I was using PRPNet 4.3.7. But PFGW wasn't enabled in that configuration.
The log file has since been overwritten. I do remember, though, that when I was first configuring PRPNet for running GFN on CUDA I was getting jobs that would abort after about 30 seconds with a false positive result. This may have been one of those false alarms?
Digging back through my email I found this notification email:
Subject: Candidate 406306^262144+1 was found to be PRP by PRPNet!
From: sm5ymt@sm5ymt.se
12/12/11
This number is approximately 1470328 digits long. It was found on machine 90031 using the program . Since the test performed as only a PRP test, another program, such as PFGW must be used to prove primality. If the number is prime and is large enough for the Prime Pages, please include the program in the credits. If adding to the Prime Pages don't forget to include project "PrimeGrid" in the credits.
It arrived in a cluster of other emails that announced actual prime discoveries through PRPNet, and I think all of them were false alarms.
Can't hurt to run it through PFGW, though, just to be sure. | |
|
|
This is listed as being found back in December '11, when I was using PRPNet 4.3.7. But PFGW wasn't enabled in that configuration.
The log file has since been overwritten. I do remember, though, that when I was first configuring PRPNet for running GFN on CUDA I was getting jobs that would abort after about 30 seconds with a false positive result. This may have been one of those false alarms?
Digging back through my email I found this notification email:
Subject: Candidate 406306^262144+1 was found to be PRP by PRPNet!
From: sm5ymt@sm5ymt.se
12/12/11
This number is approximately 1470328 digits long. It was found on machine 90031 using the program . Since the test performed as only a PRP test, another program, such as PFGW must be used to prove primality. If the number is prime and is large enough for the Prime Pages, please include the program in the credits. If adding to the Prime Pages don't forget to include project "PrimeGrid" in the credits.
It arrived in a cluster of other emails that announced actual prime discoveries through PRPNet, and I think all of them were false alarms.
Can't hurt to run it through PFGW, though, just to be sure.
I would suggest you run it manually with genefercuda first (or at the same time). If it is a false positive, you could abort pfgw teste and save a lot of hours. Good luck, anyway.
____________
676754^262144+1 is prime | |
|
|
I would suggest you run it manually with genefercuda first (or at the same time). If it is a false positive, you could abort pfgw teste and save a lot of hours. Good luck, anyway.
I can see that is a good idea. 1 hour vs. approx 25 days (and that's with the fastest CPU I have!)
geneferCUDA test is underway now and I should have an answer in 1:09. PFGW still running as well, just in case, but much more slowly :) | |
|
|
I would suggest you run it manually with genefercuda first (or at the same time). If it is a false positive, you could abort pfgw teste and save a lot of hours. Good luck, anyway.
I can see that is a good idea. 1 hour vs. approx 25 days (and that's with the fastest CPU I have!)
geneferCUDA test is underway now and I should have an answer in 1:09. PFGW still running as well, just in case, but much more slowly :)
Well, you'll probably get the same result I just did. It was (most likely) a false positive. Do not abort your test, though. gtx550ti (the card I've used to run the test) can be tricky.
/genefercuda -q "40>genefercuda -q "406306^262144+1"
genefercuda 2.3.0-0 (Windows x86 CUDA 3.2)
Copyright 2001-2003, Yves Gallot
Copyright 2009, Mark Rodenkirch, David Underbakke
Copyright 2010-2012, Shoichiro Yamada, Ken Brazier
Copyright 2011-2012, Iain Bethune, Michael Goetz, Ronald Schneider
Command line: genefercuda -q 406306^262144+1
Using default SHIFT value=7
Starting initialization...
maxErr during b^N initialization = 0.0000 (0.103 seconds).
Estimated total run time for 406306^262144+1 is 1:27:40
406306^262144+1 is a probable composite. (RES=77594a620c2e8e6b) (1470328 digits)
(err = 0.0703) (time = 1:28:46) 00:11:40
____________
676754^262144+1 is prime | |
|
|
Command line: genefercuda.exe -q 406306^262144+1
Using default SHIFT value=7
Starting initialization...
maxErr during b^N initialization = 0.0000 (0.330 seconds).
Estimated total run time for 406306^262144+1 is 1:11:38
406306^262144+1 is a probable composite. (RES=77594a620c2e8e6b) (1470328 digits)
(err = 0.0703) (time = 1:13:17) 17:17:10
Confirmed. | |
|
|
Done.
PFGW Version 3.6.3.64BIT.20120316.Win_Dev [GWNUM 27.5]
Primality testing 406306^262144+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using generic reduction AVX Core2 type-3 FFT length 512K, Pass1=128, Pass2=4K on 406306^262144+1
406306^262144+1 is composite (53232.3874s+0.0531s)
Done.
Sorry..
Lennart
| |
|
Message boards :
Project Staging Area :
Probable Prime (GFN) |