20200904, 07:12  #23  
Aug 2020
2^{3}×3 Posts 
Thanks a lot for all the help so far!
I read about srsieve2, but wasn't sure if it's ready yet. Maybe rogue can say if for fixed k and n in the 3M4M range which of sr1sieve, sr2sieve or srsieve2 is fastest? Quote:
Last fiddled with by bur on 20200904 at 07:12 

20200904, 12:12  #24 
"Mark"
Apr 2003
Between here and the
2×2,953 Posts 
If k is so large that you cannot build Legendre tables, then srsieve2 is probably faster. The Legendre logic fully coded and tested in srsieve2.

20200904, 15:22  #25 
"Curtis"
Feb 2005
Riverside, CA
7×617 Posts 

20200906, 17:44  #26 
Aug 2020
2^{3}×3 Posts 
I will do a comparison later, first I want to finish sieving... I'm at 5e12 now and factors are coming in considerably slower, but still at about 3 min per factor. The range 3320000 <= n <= 4100000 is down to 14550 candidates.
Somewhere I read proth20 did one test on a gtx 1660 in 67 minutes (forgot the specifics of the candidate). So I will continue sieving for a while. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Sieving Question  __HRB__  Math  1  20190428 05:47 
Dumb sieving question  fivemack  Software  7  20171127 22:48 
Line sieving vs. lattice sieving  JHansen  NFSNET Discussion  9  20100609 19:25 
A question on lattice sieving  joral  Factoring  5  20080403 08:01 
Sieving question  jasong  Sierpinski/Riesel Base 5  9  20070723 00:03 