Quote:
Originally Posted by KEP
It looks like this and continues indeffinently, with use of more and more RAM:
C:\20210101_S561_startup\srsieve2_n=307325K>srsieve2cl p 37684705039 W 4 i b561_n.abcd
srsieve2cl v1.3.1, a program to find factors of k*b^n+c numbers for fixed b and variable k and
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieve started: 37684705039 < p < 2^62 with 11892969 terms (6176 < n < 25000, k*561^n+c)
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
p=0, nanM p/sec, no factors found
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic
Split 7027 base 561 sequences into 13230 base 561^2 sequences.
Sieving with generic logic

Hmm. When i was testing srsieve2cl on my GPU i had to raise "maxfactordensity". Try raising it to 25000 with M 25000 and run it again.
It *should* give you an warning if the density is to low (which is normaly set to 10).