Join PrimeGrid
Returning Participants
Community
Leader Boards
Results
Other
drummers-lowrise
|
Message boards :
Sierpinski/Riesel Base 5 Problem :
SR5 project switched to PRST
Author |
Message |
streamVolunteer moderator Project administrator Volunteer developer Volunteer tester Send message
Joined: 1 Mar 14 Posts: 1144 ID: 301928 Credit: 749,581,564 RAC: 124,439
                              
|
I just installed another program - "PRST" on SR5.
PRST is a new prime testing program developed by Pavel Atnashev. Its main advantage is a new certification method developed by Darren Li (first introduced in Genefer 2.0) which work better for tests where b <> 2. In short, new method eliminates 28-35% speed penalty appeared in LLR2 with a cost of double certification time (3% for SR5). Combined, this gives a very good speedup.
New application is available for Win32, Win64, Linux64 and Mac64 platforms.
Although new program received some testing on dev server and successfully competed few test tasks, its behavior differs from LLR2 signiticantly. Please report here If something will not work.
Note that server still have a queue of old tasks which, highly likely, will be sent first until new tasks became available. So it may take some time until new tasks will appear on your computers. Similarly, old resent task may appear for a while.
SR5 still receives increased credit comparing to other projects (we added 35% boost after switch to LLR2 to compensate LLR2 slowdowns) but it may be changed in the future.
| |
|
|
Excellent news. Hopefully, it will work flawlessly from the start. Thanks for making this improvement happen. /JeppeSN | |
|
|
My first (and only) 9.50 task was a proof task that errored out without doing any computation on a stable Xeon v4 system. It passed on a Phenom II. Fluke or ?
https://www.primegrid.com/result.php?resultid=1544680374
____________
Eating more cheese on Thursdays. | |
|
tng Send message
Joined: 29 Aug 10 Posts: 607 ID: 66603 Credit: 64,109,337,223 RAC: 15,866,628
                                                              
|
My first (and only) 9.50 task was a proof task that errored out without doing any computation on a stable Xeon v4 system. It passed on a Phenom II. Fluke or ?
https://www.primegrid.com/result.php?resultid=1544680374
Similar for me:
https://www.primegrid.com/result.php?resultid=1544706211
Reliable I7-9700, main task done by an i7-1065G7. Haven't done any other 9.50 tasks.
____________
| |
|
GregC Send message
Joined: 12 Nov 18 Posts: 127 ID: 1077873 Credit: 4,200,365,250 RAC: 2,823,289
                          
|
Got my first 9.50 main task this morning. Completed successfully with approx. 35% less time spent crunching for this machine.
https://www.primegrid.com/result.php?resultid=1544629462 | |
|
|
Haven't had any more errors on my systems, yet. (Keeping an eye on it).
The profile page task completion list however isn't showing the number of threads used.
____________
Eating more cheese on Thursdays. | |
|
streamVolunteer moderator Project administrator Volunteer developer Volunteer tester Send message
Joined: 1 Mar 14 Posts: 1144 ID: 301928 Credit: 749,581,564 RAC: 124,439
                              
|
My first (and only) 9.50 task was a proof task that errored out without doing any computation on a stable Xeon v4 system. It passed on a Phenom II. Fluke or ?
https://www.primegrid.com/result.php?resultid=1544680374
This bug was fixed few days ago, as soon as first wrong result was returned. Old DC LLR task was erroneously assigned to PRST and, of course, failed, because command line and everything else is absolutely different.
Of course those who already received bad tasks will see them failed. It's safe to ignore this "Too many exists" error.
| |
|
|
My first (and only) 9.50 task was a proof task that errored out without doing any computation on a stable Xeon v4 system. It passed on a Phenom II. Fluke or ?
https://www.primegrid.com/result.php?resultid=1544680374
This bug was fixed few days ago, as soon as first wrong result was returned. Old DC LLR task was erroneously assigned to PRST and, of course, failed, because command line and everything else is absolutely different.
Of course those who already received bad tasks will see them failed. It's safe to ignore this "Too many exists" error.
Excellent, thank you.
____________
Eating more cheese on Thursdays. | |
|
|
Glad it is being introduced on PrimeGrid. Can't wait for it to move over to GCW.
____________
| |
|
Honza Volunteer moderator Volunteer tester Project scientist Send message
Joined: 15 Aug 05 Posts: 2038 ID: 352 Credit: 8,540,741,799 RAC: 2,756,412
                                                
|
OK, performed some tests on my AMD5950X and Win11.
1, 2, 4 and 8 threads, CPU afifinty, no other things running...you know the drill.
It seems that PRST is considerably (~2x) slower with small candidates/primes like 157672*5^333603-1 (80K FFT).
No big deal, we are way past this range.
btw, PRST isn't doing Lucas sequence like LLR2 to verify it's a primes so there is not time penalty in that rare case.
Then I picked up on recent candidates like 60394*5^4384584+1 (1MB FFT)
Those are similar in speed with LLR2 doing a bit better.
I'm reading speed from time per bits since task manager in CPU load/times are way off on Windows 11.
It may be Win11 specific, it may be AMD specific so I may do extra tests on different CPUs/OSes.
____________
My stats | |
|
Honza Volunteer moderator Volunteer tester Project scientist Send message
Joined: 15 Aug 05 Posts: 2038 ID: 352 Credit: 8,540,741,799 RAC: 2,756,412
                                                
|
Now AMD 7800X3D DDR5 2x32GB, Win 2019.
It's intentionally without affinity since it acts funny otherwise.
PRST looks marginally faster there, with pretty good thread number scaling.
____________
My stats | |
|
streamVolunteer moderator Project administrator Volunteer developer Volunteer tester Send message
Joined: 1 Mar 14 Posts: 1144 ID: 301928 Credit: 749,581,564 RAC: 124,439
                              
|
Now AMD 7800X3D DDR5 2x32GB, Win 2019.
It's intentionally without affinity since it acts funny otherwise.
PRST looks marginally faster there, with pretty good thread number scaling.
You MUST use -oGerbicz=1 for LLR2. Did you? It's not enabled by default when b=5.
As for Lucas prime test etc, we're not interested in these types of tests. PRP test with Gerbicz check only, enabled as shown above.
PRST is still under development and may not be a full replacement for LLR(2). It's tuned for PrimeGrid purposes and types of tests.
| |
|
Honza Volunteer moderator Volunteer tester Project scientist Send message
Joined: 15 Aug 05 Posts: 2038 ID: 352 Credit: 8,540,741,799 RAC: 2,756,412
                                                
|
You MUST use -oGerbicz=1 for LLR2. Did you? It's not enabled by default when b=5
Oops, forgot about that and used old batch file :-(
Thanks for pointing that out.
I will let BOINC run SR5 on my hosts to get more data.
____________
My stats | |
|
|
I'm getting 20-30% increased daily output based on task time averages on Broadwell-EP and Skylake-SP hardware. Good stuff! Boosted the daily credit for my 3 active boxes right over 500k.
____________
Eating more cheese on Thursdays. | |
|
|
Once upon a time (and we can't remember when) in order to effectively run SR5 and GCW tests a host needed a minimum of a 5GB swap file.
Is this still true now that we have moved SR5 testing to the PRST application?
Will the 5GB swap still be needed for efficient GCW testing once that testing is moved to the PRST application? | |
|
streamVolunteer moderator Project administrator Volunteer developer Volunteer tester Send message
Joined: 1 Mar 14 Posts: 1144 ID: 301928 Credit: 749,581,564 RAC: 124,439
                              
|
Will the 5GB swap still be needed for efficient GCW testing once that testing is moved to the PRST application?
Short answer: No.
I don't know yet is it a regression or improvement. Probably an improvement. In-memory caching was necessary to avoid extremely slow GWNUM checkpoint processing when b<>2 (Checkpoint compression at end of test will take many minutes). PRST uses alternative checkpoint format, which can be loaded fast but requires more temporary disk space. SR5 or GCW task will require almost no memory, but FFT_SIZE*8*64 total disk space.
| |
|
|
It seems that PRST is considerably (~2x) slower with small candidates/primes like 157672*5^333603-1 (80K FFT).
No big deal, we are way past this range.
btw, PRST isn't doing Lucas sequence like LLR2 to verify it's a primes so there is not time penalty in that rare case.
PRST without -fermat option does Morrison test, which is the same as "Lucas sequence" of LLR.
prst "157672*5^333603-1" -d
Using AVX FFT length 80K, Pass1=320, Pass2=256, clm=1.
Morrison test of 157672*5^333603-1, P = 3, Q = -1, complexity = 1000840.
157672*5^333603-1 Checking gcd with factors {5}.
157672*5^333603-1 is prime! Time: 435.3 s.
With -fermat option only the PRP test is performed. It supports strong check and certificates.
prst "157672*5^333603-1" -d -fermat -check strong
Using AVX FFT length 80K, Pass1=320, Pass2=256, clm=1.
Fermat probabilistic test of 157672*5^333603-1, a = 3, complexity = 785780.
157672*5^333603-1 Gerbicz-Li check enabled, L2 = 247*196.
157672*5^333603-1 is a probable prime. Time: 305.0 s.
Note the "Gerbicz-Li check enabled" line. That algorithm is not implemented in LLR2, and it provides the speed boost.
By design, PRST is not performing anything automatically, only the test you ask for in the command line. When benchmarking, make sure you're comparing same tests with same checks. | |
|
Honza Volunteer moderator Volunteer tester Project scientist Send message
Joined: 15 Aug 05 Posts: 2038 ID: 352 Credit: 8,540,741,799 RAC: 2,756,412
                                                
|
Thanks for explanation, great answer.
____________
My stats | |
|
|
I'm getting 20-30% increased daily output based on task time averages on Broadwell-EP and Skylake-SP hardware. Good stuff! Boosted the daily credit for my 3 active boxes right over 500k.
They tell us now you found a PRST prime: 177742*5^4386703 - 1
Congratulations! Enjoy you K badge once it is validated.
Also congratulations to PRST and its creator Pavel Atnashev.
/JeppeSN | |
|
|
I'm getting 20-30% increased daily output based on task time averages on Broadwell-EP and Skylake-SP hardware. Good stuff! Boosted the daily credit for my 3 active boxes right over 500k.
They tell us now you found a PRST prime: 177742*5^4386703 - 1
Congratulations! Enjoy you K badge once it is validated.
Also congratulations to PRST and its creator Pavel Atnashev.
/JeppeSN
It was quite the surprise email! Thank you to stream for steering the stars at just the right time. And thank you to enterprise hardware for depreciating in value so fast so we can buy it so cheap. Can't wait to join the elite K club :-)
____________
Eating more cheese on Thursdays. | |
|
|
I'm getting 20-30% increased daily output based on task time averages on Broadwell-EP and Skylake-SP hardware. Good stuff! Boosted the daily credit for my 3 active boxes right over 500k.
They tell us now you found a PRST prime: 177742*5^4386703 - 1
Congratulations! Enjoy you K badge once it is validated.
Also congratulations to PRST and its creator Pavel Atnashev.
/JeppeSN
Nice! Congrats indeed! 👍️ Always nice to see a k eliminated on one of these big conjecture projects...
BTW, I see that the T5K entry for this prime is an "L" proof code, indicating the final proof was done with LLR, and has PRST credited in a secondary role. Since PRST is capable of fully proving primality by itself (although I guess it would have to be as a separate run without -fermat, either manually or initiated by the BOINC wrapper after seeing the Fermat PRP result), is this a mistake in the prime submission, or was the PRP in fact proven prime with LLR? (Or LLR2, although - as a separate known issue - the T5K site doesn't presently support selecting LLR2 as a final proof program.) | |
|
Reggie Volunteer moderator Project administrator Volunteer tester Project scientist Send message
Joined: 10 May 14 Posts: 272 ID: 311759 Credit: 441,910,457 RAC: 262,578
                         
|
BTW, I see that the T5K entry for this prime is an "L" proof code, indicating the final proof was done with LLR, and has PRST credited in a secondary role. Since PRST is capable of fully proving primality by itself (although I guess it would have to be as a separate run without -fermat, either manually or initiated by the BOINC wrapper after seeing the Fermat PRP result), is this a mistake in the prime submission, or was the PRP in fact proven prime with LLR? (Or LLR2, although - as a separate known issue - the T5K site doesn't presently support selecting LLR2 as a final proof program.)
Correct. It used an L* code because we proved it with LLR. It's just like how GFN primes use L* even though genefer software is capable of proving primality as well. We may change our approach in the future, but we were being a bit extra careful since PRST is such a new application.
I will note PRST is selectable as a "proving application" on T5K.
LLR2 likely won't be selectable as a proving application in the future. Back when it was introduced (and Caldwell ran T5K), I believe admins and developers talked about this and decided "LLR2 is basically fast-DC functionality". We need to credit it when using fast-DC, but ultimately it's still LLR code proving it. Don't quote me on that - I'd have to dig deep in discord and/or message board history, but I'm fairly sure that's the gist of what was decided. | |
|
|
And once PRST is used for the final proof of a prime, that will be an "A" code, not an "L" code. /JeppeSN | |
|
|
It was quite the surprise email! Thank you to stream for steering the stars at just the right time. And thank you to enterprise hardware for depreciating in value so fast so we can buy it so cheap. Can't wait to join the elite K club :-)
There you go. /JeppeSN | |
|
|
For CPU cache requirements is it still FFT*8 like with other LLR/LLR2 tasks or is it FFT*16 like with Primorial/Factorial?
____________
My Primes
Badge Score: 4*2 + 6*2 + 7*1 + 8*10 + 9*2 + 11*2 + 12*2 = 171
| |
|
|
CPU cache requirements are determined by the GWnum transform, not the software used. So it's FFT*8. | |
|
Message boards :
Sierpinski/Riesel Base 5 Problem :
SR5 project switched to PRST |