![]() |
|
|
#100 | |
|
Dec 2011
After milion nines:)
144810 Posts |
I found bug in srbsieve.
On first post you say Quote:
Last fiddled with by pepi37 on 2015-08-13 at 16:42 |
|
|
|
|
|
|
#101 |
|
"Mark"
Apr 2003
Between here and the
143208 Posts |
There is a limit of 50 in the code. I could change the program to exit nicely, but I see little reason that anyone would sieve to such a high n with newpgen when using this program.
|
|
|
|
|
|
#102 |
|
Dec 2011
After milion nines:)
23·181 Posts |
Ok , I go off the scale :)
Please can you clarify this phase= is used to sieve in steps. The first value is the upper n for the phase followed by the number of concurrent k to sieve and finally by the maxp of the sieving. What doest it mean, and how to calculate that number to be optimal in all phase stages? |
|
|
|
|
|
#103 |
|
I moo ablest echo power!
May 2013
22·5·89 Posts |
It will sieve a certain # of k at a time. So if you have, say, 10,000 k to go through, you can choose to do 1000 at a time for a given phase. Maybe it's a little faster? I haven't played with it much.
|
|
|
|
|
|
#104 | |
|
Dec 2011
After milion nines:)
23·181 Posts |
Quote:
![]() Thanks for explanation! |
|
|
|
|
|
|
#105 |
|
May 2009
Russia, Moscow
2,593 Posts |
uint32_t for p_max in source code seems not enough, should be uint64_t.
Code:
... Status (02:50:50): Completed phase 4: 28 remaining ERROR: 64 bit sieve is limited to primes below 2^51. Code:
... phase=120,50000,500000 phase=330,30000,3000000 phase=1200,20000,30000000 phase=4400,10000,300000000 phase=10000,5000,3000000000 |
|
|
|
|
|
#106 |
|
May 2009
Russia, Moscow
2,593 Posts |
Code:
#ifdef WIN32
sprintf(buffer, "del %s sr_b.pfgw pfgw.ini", inFileName);
system("pfgw64 -Cquiet -f0 sr_b.pfgw > nul");
system(buffer);
#else
sprintf(buffer, "rm %s sr_b.pfgw pfgw.ini", inFileName);
system("./pfgw64 -Cquiet -f0 sr_b.pfgw > nul");
system(buffer);
#endif
|
|
|
|
|
|
#107 | |
|
Dec 2011
After milion nines:)
23×181 Posts |
Yes, got same error four times ( on four cores)
Status (09:25:33): Completed phase 5: 13 remaining ERROR: 64 bit sieve is limited to primes below 2^51. my ini file Quote:
|
|
|
|
|
|
|
#108 |
|
"Mark"
Apr 2003
Between here and the
24·397 Posts |
Okay. I think I've got everyone's suggestions implemented.
|
|
|
|
|
|
#109 |
|
"Mark"
Apr 2003
Between here and the
24×397 Posts |
One mistake, I have /dev/nul instead of /dev/null. I'll update if another bug is found.
|
|
|
|
|
|
#110 |
|
I moo ablest echo power!
May 2013
22·5·89 Posts |
My house had a short power outage. Is there a good way to try and pick back up with srbsieve, at least in terms of having it remove all the k's that have a prime found, or, even better, near the last n it was searching?
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Very Prime Riesel and Sierpinski k | robert44444uk | Open Projects | 587 | 2016-11-13 15:26 |
| Sierpinski/ Riesel bases 6 to 18 | robert44444uk | Conjectures 'R Us | 139 | 2007-12-17 05:17 |
| Sierpinski/Riesel Base 10 | rogue | Conjectures 'R Us | 11 | 2007-12-17 05:08 |
| Sierpinski / Riesel - Base 23 | michaf | Conjectures 'R Us | 2 | 2007-12-17 05:04 |
| Sierpinski / Riesel - Base 22 | michaf | Conjectures 'R Us | 49 | 2007-12-17 05:03 |