20210116, 07:45  #287 
Oct 2006
Berlin, Germany
1001100100_{2} Posts 
If I run sr1sieve version 1.4.5
sr1sieve_1.4.5x86_64linux P 15257050000000000 i in o out f factor1.txt) I get an out file with this format: Code:
15257500000000000:M:1:10:258 92 1400033 92 1400035 92 1400045 92 1400068 92 1400075 ... sr1sieve_1.4.7_aarch64 P 15257050000000000 i in o out f factor1.txt I get an out file with this format: Code:
ABCD 92*10^$a1 [1400033] // Sieved to 15257500000000000 2 10 23 ... Background is that I run a task on different hosts and compare the results afterwards to ensure valid results. 
20210116, 08:02  #288 
Romulan Interpreter
Jun 2011
Thailand
22345_{8} Posts 
You may have some options (was it w or G? I don't recall) to convert file formats, or you also can call srfile after the run, to convert to pfgw format, or newpgen format, or any format.
edit: I only have 1.4.5 here, you can call "srfile g second_file" to get the "first_file" (i.e. convert from abc format to newpgen format). For details, see "srfile h" and "sr1sieve h". Last fiddled with by LaurV on 20210116 at 08:11 
20210310, 18:54  #289 
Aug 2020
167_{10} Posts 
Does sr1sieve support Riesel and Proth numbers in the same sieve? I combined two seperate sieves using srfile and sr1sieve threw the error
Code:
Cannot support multiple sequences in input file `sr_2.abcd'. I wanted to use it since it was the fastest among sr1sieve, sr2sieve and srsieve2 for my fixed k. Does it even make sense efficiencywise to combine sieve files like that or would it be the same if I ran them seperately? 
20210310, 19:12  #290 
"Alexander"
Nov 2008
The Alamo City
3^{2}·67 Posts 
sr1sieve doesn't support multiple sequences period. It's optimized for a single sequence (i.e. k). The traditional rule of thumb is to use sr2sieve for 3 or more k's, sr1sieve for 1 or 2 (two separate instances in the latter case), and srsieve/srsieve2 just to start (I go to 1e9 because my workflow is highly automated by e9, but that's probably not optimal), but I think srsieve2cl (GPU, not srsieve2 for CPU) is faster than even sr1sieve for a single k.
Last fiddled with by Happy5214 on 20210310 at 19:13 Reason: Clarify 
20210310, 19:35  #291  
"Mark"
Apr 2003
Between here and the
2×3×1,051 Posts 
Quote:


20210312, 11:59  #292  
Aug 2020
10100111_{2} Posts 
Generally it's adviced to sieve the whole set of candidates in one sieve as computation time increases only with the sqrt of the number of candidates. But does this rule still apply in the case of +1 and 1 combined?
If not, then sr1sieve run on two seperate sieves would be more efficient. I cannot test it right now as I don't have access to the computer. Quote:
Last fiddled with by bur on 20210312 at 12:01 

20210316, 18:58  #293 
May 2020
36_{10} Posts 
Code:
../srsieve2cl P 5e13 i candy2.cand o candy.cand f A W 4 G 1 srsieve2cl v1.5.2, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Sieving one sequence where abs(c) = 1 for p >= 15175098061843 Split 1 base 13 sequence into 19 base 13^120 sequences. 551218 bytes used for congruence tables 351 bytes used for Legendre tables *** buffer overflow detected ***: terminated Aborted (core dumped) 
20210316, 19:26  #294  
"Mark"
Apr 2003
Between here and the
2·3·1,051 Posts 
Quote:


20210317, 11:55  #295 
May 2020
2^{2}×3^{2} Posts 
Here's the list of candidates. I have been running it under srsieve2 (and, indeed, even with srsieve2cl with no GPU workers) with no issues, so I do think it's a GPU error on my end.

20210317, 12:29  #296 
"Mark"
Apr 2003
Between here and the
1100010100010_{2} Posts 
I did find one bug in CisOneWithOneSequenceHelper.cpp and committed a fix, but that bug prevented compilation on OS X. The sequence in this file works on two different GPUs that I've tried, one AMD and one NVIDIA.
If you get the updated file and rebuild (start with make clean), are you able to do any debugging? Have you run any of the other GPUenabled sievers built on the framework? Do any of those work? 
20210317, 18:47  #297  
May 2020
2^{2}×3^{2} Posts 
Quote:
Here's another example where I start sieving on a random sequence, leading me to believe it's not a sequence problem, neither: Code:
../srsieve2cl G 1 P 1e13 n 1000 N 1500 s "2564*2345^n+1" srsieve2cl v1.5.2, 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 Creating CPU worker to use until p >= 1000000 GPU primes per worker is 56320 Sieve started: 3 < p < 1e13 with 501 terms (1000 < n < 1500, k*2345^n+c) (expecting 482 factors) Sieving one sequence where abs(c) = 1 for p >= 2564 Split 1 base 2345 sequence into 11 base 2345^30 sequences. 552614 bytes used for congruence tables 376119 bytes used for Legendre tables Creating CPU worker to use until p >= 1000000 *** buffer overflow detected ***: terminated Aborted (core dumped) 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Sieving twins with srsieve  henryzz  Twin Prime Search  0  20140318 12:44 
Intel announces multicore enhancements for Haswell chips  ixfd64  Hardware  8  20120210 20:32 
LLRnet enhancements  kar_bon  No Prime Left Behind  10  20080328 11:21 
TODO list and suggestions/comments/enhancements  Greenbank  Octoproth Search  2  20061203 17:28 
Suggestions for future enhancements  Reboot It  Software  16  20031017 01:31 