20210209, 22:55  #540 
"Mark"
Apr 2003
Between here and the
2×3,217 Posts 
I have released 2.2.0:
Code:
framework: Updated OpenCL on Windows. See makefile for details. Updated primesieve to 7.6. psieve, psievecl: version 1.4 Some refactoring to support OpenCL worker. First release of psievecl. Verify factors from I input file srsieve2, srsieve2cl: version 1.5.1 Fixed bug that was introduced in the refactoring of 1.5 that impacts generic sieving while using multiple threads. Added R to remove sequences. Use Rk*b^n+c format to remove a single sequence or use R with a file that has multiple sequences. This is not tested yet. One odd behavior is that I noticed that srsieve2cl is slower than the previous release, but I do not know why. Even after reverting the framework changes for the release it was slower. I thought it was the update to OpenCL or primesieve, but reverting to the older versions of those made no difference. I'm likely missing something, but I don't know what. I'm hoping that someone is willing to give the R option with srsieve2 a spin. 
20210210, 02:51  #541  
"Alexander"
Nov 2008
The Alamo City
3·11·23 Posts 
Quote:
Code:
$ ./srsieve2 i b2_n.abcd o b2_n.abcd R "658687*2^n1" srsieve2 v1.5.1, a program to find factors of k*b^n+c numbers for fixed b and variable k and n 2018 terms for sequence 658687*2^n1 have been removed Must use generic sieving logic because there is more than one sequence Sieving with generic logic for p >= 982453051 Fatal Error: Expected 62636 terms when building sequences, but counted only 60618 

20210210, 04:16  #542  
"Mark"
Apr 2003
Between here and the
1100100100010_{2} Posts 
Quote:


20210223, 17:15  #543 
"Mark"
Apr 2003
Between here and the
6434_{10} Posts 
I have released 2.2.1. Here are the changes:
[quote] framework: no changes gfndsieve, gfndsievecl: version 2.0 Moved GFN divisor testing to GFNDivisorTester class so that GFNDivisorApp is smaller and so that future support of nonx86 is easier since GFNDivisorTester calls a number of x86 asm methods directly. For gfndsievecl do not report any terms with factors < 50. This reduces the size needed for the buffer that is used to report factors. Added r and R options to support functionality similar to ppsieve. r will not generate a bitmap for tracking terms. It will only generate an output file of factors. R is used with r. If a term has a factor below 32767 (the default value), then the program will not output any factors for the term. r and x are mutually exclusive with r overriding x. Added various speed improvements. srsieve2, srsieve2cl: version 1.5.2 Fixed issue with CisOne logic as it tries to rebuild sequences when there are multiple sequences as that is not yet supported. [quote] In what limited performance testing I have done it appears that gnfdsievecl with r is about 5x faster than the OpenCL version of ppsieve. I think some of that is due to using a much higher value for S in gnfdsievecl than what ppsievecl does, but that doesn't explain the entirely of the speed gain. The CPU only version is about 3x slower than ppsieve, but that is due to a lot of finetuned assembler in the ppsieve CPU code. I don't expect anyone to use it for that, but at the same time gfndsieve should be about 50% faster for typical gfn divisor sieving. 
20210227, 18:43  #544 
Nov 2020
2×5 Posts 
Can someone make a program for sieving sequences of the form k_{1}*b_{1}^n+k_{2}*b_{2}^n+c with variable n?
Last fiddled with by YaoPlaysMC on 20210227 at 18:43 
20210812, 19:53  #545 
Mar 2019
310_{8} Posts 
There appears to be something broken with gfndsieve at head. This is from the latest svn build:
Code:
./gfndsieve P 1e11 W 36 n 10000 N 100000 k 1e5 K 1e6 o gfn.txt gfndsieve v2.0, a program to find factors of k*2^n+1 numbers for variable k and n Sieve started: 3 < p < 1e11 with 40500450000 terms (100001 <= k <= 999999, 10000 <= n <= 100000, k*2^n+1) (expecting 38743756770 factors) Fatal Error: Invalid factor: 100007*2^99457+1 mod 100271 = 13484 
20210812, 20:09  #546  
"Mark"
Apr 2003
Between here and the
2·3,217 Posts 
Quote:


20210813, 05:49  #547 
"Adolf"
Nov 2013
South Africa
2·31 Posts 
I had the same the same issue with a previous build. You found the problem back then. https://www.mersenneforum.org/showthread.php?t=22890 
20210813, 12:03  #548  
"Mark"
Apr 2003
Between here and the
1922_{16} Posts 
Quote:


20210813, 15:03  #549 
"Mark"
Apr 2003
Between here and the
2·3,217 Posts 
The problem with gfnsieve is fixed in sourceforge.

20210813, 17:16  #550 
"Evan"
Dec 2020
Montreal
71_{10} Posts 
Similar? issue to what I reported on page 46  latest svn
Code:
/Math/mtsieve$ ./srsieve2cl n 100000 N 500000 o out.txt s "(88*10^n7)/9" srsieve2cl v1.5.3, 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 25600 Sieve started: 3 < p < 2^62 with 400001 terms (100000 < n < 500000, k*10^n+c) Fatal Error: Invalid factor: (88*10^1000007)/9 mod 3 = 18446744073709551610 