20210123, 01:38  #254 
"Nuri, the dragon :P"
Jul 2016
Good old Germany
7·11^{2} Posts 
Mark, could you post the source from srbsieve here please? I want to try out something.

20210123, 04:44  #255 
"Mark"
Apr 2003
Between here and the
197D_{16} Posts 

20210123, 13:06  #256 
"Nuri, the dragon :P"
Jul 2016
Good old Germany
847_{10} Posts 
Thanks, i was blind.
I was thinking about to use fbncsieve instead of newpgen and even implement fbncsieve into srbsieve. This *should* improve the speed for very low n´s. So here is what I am considering: 1. Removing k´s that have k and b odd 2. Removing trivial factorisation and MOB´s 3. Now taking those remaining k´s into fbncsieve for n=1 and sieve until only primes are remaining; repeat that step until x (e.g. 20 for R7 works fine, takes a bit but removal rate is worth it!) Please note that removing the k´s that have been primed on n=1 should improve the sieve speed for n=2 and so on. (On R7 e.g. 1G has ~24.000.000 primes on N=1) The reason why is this: Code:
Status (00:00:44): Removed 418373 terms from newpgen for n = 15: 5749716 remaining Status (00:00:45): Removed 379781 terms from newpgen for n = 16: 5369935 remaining It took me 5 minutes to sieve for n=15, but processing those 418k k´s would take ~23 hours. Increasing the nvalue would mean it requires and higher pvalue; but again less k´s should bring us faster speed. I am asking for a lot here, but i am certain those changes could bring us quite forward with processing new bases / ranges much faster. R7 seems to be as prime dense as R3 so running to 1G for now might be worth it; and maybe even consider going deeper in the next years. Anyway srbsieve is already a powerful tool regardless, but we can improve and keep up improving over the years. I highly value your tireless efforts for this project; and others. 
20210123, 13:47  #257 
"Mark"
Apr 2003
Between here and the
14575_{8} Posts 
I see what you are saying. I wrote one before the other existed. I'll look into it, but working the bugs out of the next release of srsieve2 is top on my priority list. It's close to working, but crashes and I haven't figured out why yet although I have some ideas.

20210206, 15:11  #258 
"Mark"
Apr 2003
Between here and the
3^{2}·5^{2}·29 Posts 
I looked at the code. It will take a file in ABCD format (abcdfile=) or newpgen format (npgfile=). Right now it supports up 50 entries (up to n=50). Going past has less value because of how it might take to sieve to sqrt(k*b^50) if you consider that most k one would be using this with are at least 30 bits and as any b for this must be >= 7. fbncsieve can output either format.
The only enhancement I could see is modifying srbsieve to execute fbncsieve (like it does srsieve/srsieve2) instead of one needing to run it externally first. 
20210206, 16:33  #259  
"Nuri, the dragon :P"
Jul 2016
Good old Germany
7×11^{2} Posts 
Quote:
Yep, i think so aswell. However i dont know up to which nvalue it is still effective or not. The difference between processing up to n=13 and n=16 was around 6 hours for an krange of 100M. I can only do more testing when i start the next range, which might be in around 23 months. I expect n=20 to be the best value, but we will see. 

20210206, 18:27  #260 
"Mark"
Apr 2003
Between here and the
3^{2}·5^{2}·29 Posts 
I added code to support this suggestion but have done zero testing. You can access it by adding the line "maxNfbncsieve=" to the ini file and specifying the max n before switching to srsieve/sr2sieve/sr2sievecl. Right now it doesn't delete the ABCD files created by fbncsieve. I'll do that after we know that it is working.

20210206, 20:00  #261 
"Nuri, the dragon :P"
Jul 2016
Good old Germany
7×11^{2} Posts 
I will test it once i have free resources and will let you know

20210314, 23:28  #262 
"Mark"
Apr 2003
Between here and the
14575_{8} Posts 

20210317, 17:54  #263 
"Mark"
Apr 2003
Between here and the
197D_{16} Posts 
I found one bug when using fbncsieve. That is now fixed. I have been playing with starting a new base with it (S1020). It is nice to have to avoid the extra steps of newpgen before running srbsieve. As for S1020, this is going to take some time on a single core because 1020 is divisible by 2, 3, and 5, which means that a lot more candidates survive sieving than for other bases.
If you have a fast GPU, I suggest that you compare the speed of the GPU with the speed of the CPU to determine if srsieve2cl or srsieve2 will benefit you more. 
20210412, 17:58  #264 
"Mark"
Apr 2003
Between here and the
3^{2}×5^{2}×29 Posts 
It would be nice if http://www.noprimeleftbehind.net/cru...sunproven.htm either had a link to the remaining k or a link to a preserved file or both.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Useless SSE instructions  __HRB__  Programming  41  20120707 17:43 
Questions about software licenses...  WraithX  GMPECM  37  20111028 01:04 
Software/instructions/questions  gd_barnes  No Prime Left Behind  48  20090731 01:44 
Instructions to manual LLR?  OmbooHankvald  PSearch  3  20050805 20:28 
Instructions please?  jasong  Sierpinski/Riesel Base 5  10  20050314 04:03 