![]() |
![]() |
#837 |
"Mark"
Apr 2003
Between here and the
7,237 Posts |
![]()
Thanks.
|
![]() |
![]() |
![]() |
#838 |
"Alexander"
Nov 2008
The Alamo City
22×5×72 Posts |
![]()
Can you make it stop automatically once it prints out the q's when passing the -Q flag? Not having to worry about killing the sieve will make writing a script to orchestrate automated testing of q's easier.
|
![]() |
![]() |
![]() |
#839 |
"Mark"
Apr 2003
Between here and the
7,237 Posts |
![]()
Try using -A and passing an empty factor file with -I. I think that would work.
|
![]() |
![]() |
![]() |
#840 | |
"Alexander"
Nov 2008
The Alamo City
11110101002 Posts |
![]() Quote:
Code:
../../../bin/srsieve2cl -A -I /dev/null -i b2_n.boinc -Q Code:
srsieve2cl v1.6.6, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Read 0 factors from /dev/null which removed 0 terms. |
|
![]() |
![]() |
![]() |
#841 |
"Mark"
Apr 2003
Between here and the
723710 Posts |
![]()
Create an empty file in the directory. Use that with -I.
|
![]() |
![]() |
![]() |
#842 | |
"Alexander"
Nov 2008
The Alamo City
22×5×72 Posts |
![]() Quote:
Code:
$ ../../../bin/srsieve2cl -A -I blank_file -i b2_n.boinc -Q srsieve2cl v1.6.6, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Read 0 factors from blank_file which removed 0 terms. Last fiddled with by Happy5214 on 2022-12-13 at 16:12 |
|
![]() |
![]() |
![]() |
#843 |
"Mark"
Apr 2003
Between here and the
7,237 Posts |
![]()
So the use of -A and -I doesn't work.
How about this? srieve2cl -ifile.abcd -p1000000 -P1000100 -ofile.temp -Q You can throw out file.temp after running this. Last fiddled with by rogue on 2022-12-13 at 17:22 |
![]() |
![]() |
![]() |
#844 | |
"Alexander"
Nov 2008
The Alamo City
22×5×72 Posts |
![]() Quote:
Code:
$ ../../../bin/srsieve2cl -i b2_n.boinc -P 5 -o /dev/null -Q srsieve2cl v1.6.6, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Must use generic sieving logic because -l was not specified for mutiple sequences Sieving with generic logic for p >= 1000000000000 q = 2 with 5 subseq yields bs = 1116, gs = 224, work = 2239 a bunch more q's q = 1 with 5 subseq yields bs = 1582, gs = 316, work = 3164 Split 5 base 2 sequences into 18 base 2^72 sequences. Fatal Error: pmin must be less than pmax I can work with this now. Another question I had is about the interplay between -q and -g. Is the best q (by speed, not score) going to be the fastest regardless of the value chosen for -g, allowing me to check for q, fix it, and check the -g values; or do I have to check all (reasonable) q/-g combinations within that 20% q score threshold, sort of like a 2×2 matrix? |
|
![]() |
![]() |
![]() |
#845 |
"Mark"
Apr 2003
Between here and the
7,237 Posts |
![]()
Some settings of -q will allow you to increase -g others will require you to decrease -g as -q can impact how much memory is needed by each kernel.
Last fiddled with by rogue on 2022-12-13 at 18:55 |
![]() |
![]() |
![]() |
#846 |
Jun 2012
Boulder, CO
23×3×19 Posts |
![]()
Another bug in srsieve2?
Code:
$ ./srsieve2 -P 4e14 -o out.txt -W 32 -s "11*2^n+1" -n 15e6 -N 25e6 srsieve2 v1.6.6, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Sieving with generic logic for p >= 3 Sieve started: 3 < p < 4e14 with 10000001 terms (15000000 < n < 25000000, k*2^n+1) (expecting 9673251 factors) Sieving with single sequence c=1 logic for p >= 257 BASE_MULTIPLE = 30, POWER_RESIDUE_LCM = 720, LIMIT_BASE = 720 Fatal Error: Expected 15 subsequences but 233 were created |
![]() |
![]() |
![]() |
#847 |
Random Account
Aug 2009
Not U. + S.A.
24×173 Posts |
![]()
I awakened very early this morning to find the latest srsieve2cl has caused a reboot. Not sure why. It may be in the system logs. I haven't looked yet.
|
![]() |
![]() |