Bases 501-1030 reservations/statuses/primes

[rebirther]

Reserving S504 to n=300k (250-300k) for BOINC

[KEP]

S561 is tested to n=6175 there is 7027 sequences remaining.

I'm amazed how prime this conjecture is.

Now srsieve2 is set to sieve, untill it takes about 18 seconds per factor. This should be around p=240G

[rogue]

Originally Posted by KEP

S561 is tested to n=6175 there is 7027 sequences remaining.

I'm amazed how prime this conjecture is.

Now srsieve2 is set to sieve, untill it takes about 18 seconds per factor. This should be around p=240G

Definitely use srsieve2cl if you have a good enough GPU.

[KEP]

Originally Posted by rogue

Definitely use srsieve2cl if you have a good enough GPU.

It did not work, it seems that it starts from p=0 and then researches all those factors I had already found and tested below ~p=31.5G - I must add, that I used the -p flag and yet it took up more and more memory and kept writing p=0 nanM (or something similar). My GPU is 7 years old, so it might not be suited

[gd_barnes]

Originally Posted by KEP

S561 is tested to n=6175 there is 7027 sequences remaining.

I'm amazed how prime this conjecture is.

Now srsieve2 is set to sieve, untill it takes about 18 seconds per factor. This should be around p=240G

Can you please post the primes and k's remaining?

[rogue]

Originally Posted by KEP

It did not work, it seems that it starts from p=0 and then researches all those factors I had already found and tested below ~p=31.5G - I must add, that I used the -p flag and yet it took up more and more memory and kept writing p=0 nanM (or something similar). My GPU is 7 years old, so it might not be suited

Hmm. Maybe too many sequences to handle at one time.

[KEP]

Originally Posted by gd_barnes

Can you please post the primes and k's remaining?

Primes and k's remaining is e-mailed to you

[KEP]

Originally Posted by rogue

Hmm. Maybe too many sequences to handle at one time.

It looks like this and continues indeffinently, with use of more and more RAM:

C:\20210101_S561_startup\srsieve2_n=3073-25K>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

[rogue]

Can you post your abcd file (7z format) or send via e-mail? I will take a look.

[MisterBitcoin]

Originally Posted by KEP

It looks like this and continues indeffinently, with use of more and more RAM:

C:\20210101_S561_startup\srsieve2_n=3073-25K>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).

[rogue]

Originally Posted by MisterBitcoin

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).

I figured out why this is happening. It will be fixed in then next release.

For now avoid using -W with srsieve2cl. By default it will use -W0 and -G1. It will use the CPU for testing until p > 1e6 then switch to the GPU.