20210217, 20:11  #111  
Dec 2011
After milion nines:)
2^{3}×5×37 Posts 
Quote:


20210218, 00:17  #112  
"Mark"
Apr 2003
Between here and the
3·2,143 Posts 
Quote:
I've asked in the PrimeGrid developerscorner over at discord, but no response. [rant] This is one of the beefs I have with PrimeGrid. The are in a hurry to get people to build stuff for them, but they have a lot of difficulty with people that live outside of their world of influence, which includes me. I create much faster sievers than anything they have used and they basically ignore what I produce. They won't even discuss it. Very frustrating. [/rant] 

20210218, 16:28  #113  
"Nuri, the dragon :P"
Jul 2016
Good old Germany
2^{2}×11×19 Posts 
Quote:
Strangly enough i got this one on the latest version: Code:
C:\Users\Administrator\Documents\cllr S649\r15\thread 1>srsieve2.exe s remain.txt n 25000 N 100000 P 15e9 srsieve2 v1.5.1, a program to find factors of k*b^n+c numbers for fixed b and va riable k and n Sieving with generic logic for p >= 3 Fatal Error: Expected 825011 terms, but only set 0 I also got a bug with using multithreading on 1.4 (which was fixed); so i am back using v1.1 which works fine. Creating the sieve file on my main pc now. :D 

20210218, 17:29  #114  
"Mark"
Apr 2003
Between here and the
3×2,143 Posts 
Quote:


20210219, 14:38  #115  
"Mark"
Apr 2003
Between here and the
3·2,143 Posts 
Quote:


20210219, 15:56  #116 
Quasi Admin Thing
May 2005
967 Posts 
I saw exactly same error on my machine. I in fact had to roll back to the version of srsieve2 that Reb has on his BoincConfederation website. This was when resuming and not when starting from scratch. It was for base S561. One big difference between 2.2.0 and between Rebs version was that 2.2.0 used 638000 KB while Rebs version used only 68000 KB. Maybe that can give you a lead

20210219, 16:40  #117  
"Mark"
Apr 2003
Between here and the
3·2,143 Posts 
Quote:


20210220, 08:44  #118  
Quasi Admin Thing
May 2005
967 Posts 
Quote:
C:\20210101_S561_startup\srsieve2_n=307325K>srsieve2 p 96467343541 W 4 w 10000 i b561_n.abcd srsieve2 v1.5.1, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Cannot use Legendre tables because squarefree part of k is too large Must use generic sieving logic because there is more than one sequence Sieving with generic logic for p >= 96467343541 Split 5604 base 561 sequences into 5604 base 561^1 sequences. Sieve started: 96467343541 < p < 2^62 with 7810916 terms (9001 < n < 25000, k*561^n+c) Must use generic sieving logic because there is more than one sequence Sieving with generic logic for p >= 96468358331 Split 5604 base 561 sequences into 5604 base 561^1 sequences. Must use generic sieving logic because there is more than one sequence Sieving with generic logic for p >= 96469371701 Split 5604 base 561 sequences into 5604 base 561^1 sequences. Must use generic sieving logic because there is more than one sequence Sieving with generic logic for p >= 96470381507 Split 5604 base 561 sequences into 5604 base 561^1 sequences. Must use generic sieving logic because there is more than one sequence Sieving with generic logic for p >= 96471394813 Split 5604 base 561 sequences into 5604 base 561^1 sequences. Must use generic sieving logic because there is more than one sequence Sieving with generic logic for p >= 96472407233 Split 5604 base 561 sequences into 5604 base 561^1 sequences. p=0, nanM p/sec, no factors found Must use generic sieving logic because there is more than one sequence Sieving with generic logic for p >= 96473417713 Split 5604 base 561 sequences into 5604 base 561^1 sequences. Must use generic sieving logic because there is more than one sequence Sieving with generic logic for p >= 96474430733 Split 5604 base 561 sequences into 5604 base 561^1 sequences. Must use generic sieving logic because there is more than one sequence Sieving with generic logic for p >= 96475448009 Split 5604 base 561 sequences into 5604 base 561^1 sequences. Without W and w everything checksout fine: C:\20210101_S561_startup\srsieve2_n=307325K>srsieve2 p 96467343541 i b561_n.abcd srsieve2 v1.5.1, a program to find factors of k*b^n+c numbers for fixed b and variable k and n Cannot use Legendre tables because squarefree part of k is too large Must use generic sieving logic because there is more than one sequence Sieving with generic logic for p >= 96467343541 Split 5604 base 561 sequences into 5604 base 561^1 sequences. Sieve started: 96467343541 < p < 2^62 with 7810916 terms (9001 < n < 25000, k*561^n+c) p=96469028651, 1.092K p/sec, 5 factors found at 17.30 sec per factor (last 1 min) So somewthing got fixed while something got broken unfortunantly Keep up the good work 

20210220, 15:10  #119 
"Mark"
Apr 2003
Between here and the
3·2,143 Posts 
I'm fairly certain I know the cause of this.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
mtsieve  rogue  Software  575  20211011 21:46 
srsieve/sr2sieve enhancements  rogue  Software  300  20210318 20:31 
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 