![]() |
|
|
#254 | |
|
"Mark"
Apr 2003
Between here and the
24×397 Posts |
Quote:
g++ -O3 -m64 nsieve64.cpp -lstdc++ -o nsieve It is currently slower than fermfact, but I found one optimization that seems to make it faster for multiple n, but I need to run some side-by-side comparisons with fermfact. If someone can build and compare with newpgen (for a single n), that would be great. Note that newpgen stops automatically when p > sqrt(maxk*2^n+1). nsieve does not stop automatically. I also intend to modify nsieve to be multi-threaded, but I'm concerned about the performance it could take. |
|
|
|
|
|
|
#255 |
|
"Mark"
Apr 2003
Between here and the
18D016 Posts |
I just ran one test. nsieve and newpgen do not produce the same outputs. I assume that nsieve must have some bugs in it. That will take time to resolve.
Last fiddled with by rogue on 2017-08-24 at 20:26 |
|
|
|
|
|
#256 |
|
I moo ablest echo power!
May 2013
22×5×89 Posts |
Yeah, I was just about to post the same thing. Using n=30 with k=8e8-800000500, I get 12 candidates remaining from newpgen. Nsieve's last output on screen shows 8 remaining, and the output file has the proper header and then nothing else.
|
|
|
|
|
|
#257 |
|
Dec 2011
After milion nines:)
23·181 Posts |
I got empty output from your build Rogue
|
|
|
|
|
|
#258 |
|
"Mark"
Apr 2003
Between here and the
24×397 Posts |
|
|
|
|
|
|
#259 |
|
"Mark"
Apr 2003
Between here and the
24×397 Posts |
It appears to be a miscompile on Windows with mingw. The outputs on my Mac are different and appear to be correct, although I haven't run any comparisons.
|
|
|
|
|
|
#260 |
|
I moo ablest echo power!
May 2013
22×5×89 Posts |
Are you able to compile it on a Linux system at all and confirm whether it mismatches?
|
|
|
|
|
|
#261 |
|
"Mark"
Apr 2003
Between here and the
24×397 Posts |
The first test I ran shows non-matching output on my Mac. I don't think this is a miscompile. It is either bad assembly code or the prime sieve is missing primes.
|
|
|
|
|
|
#262 |
|
"Mark"
Apr 2003
Between here and the
143208 Posts |
nsieve is only for base 2, so it isn't too helpful for this project.
|
|
|
|
|
|
#263 |
|
"Mark"
Apr 2003
Between here and the
143208 Posts |
I ran into an issue with srbsieve. When it breaks up large ranges for PRP testing it is skipping some of those ranges. I don't how that is happening, but I'm looking into it.
This means that if you did a large range of k with srbsieve it is likely that some of the k in pl_remain.txt have a prime for n < 25000. This has a definite impact on R3 and S3, but I can't speak for other bases. If you have used srbsieve then you should run from n=1 to 25000 for the k in pl_remain.txt to find any primes that it missed. There are no issues with the numbers in pl_prime.txt. They will be prime. Unfortunately this is going to create a lot of work for me due to the work I have done on S3. Hopefully I will have time between Christmas and New Year's to track down the problem and fix it. Last fiddled with by rogue on 2017-12-15 at 16:49 |
|
|
|
|
|
#264 |
|
Quasi Admin Thing
May 2005
2×3×7×23 Posts |
Does this problem concern all versions of srbsieve or only those that did checkpoint and allowed to resume? I used for my R3 ranges, the version that did not support stopping and starting again - in other words no resume was allowed.
|
|
|
|
![]() |
| 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 |