20210115, 17:46  #3807 
Sep 2011
Germany
101111001111_{2} Posts 
Reserving S504 to n=300k (250300k) for BOINC

20210121, 17:29  #3808 
Quasi Admin Thing
May 2005
969_{10} Posts 
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 
20210121, 19:01  #3809 
"Mark"
Apr 2003
Between here and the
3^{2}×719 Posts 

20210121, 19:42  #3810 
Quasi Admin Thing
May 2005
3·17·19 Posts 
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

20210121, 20:30  #3811 
May 2007
Kansas; USA
3^{3}×17×23 Posts 

20210121, 21:15  #3812  
"Mark"
Apr 2003
Between here and the
3^{2}×719 Posts 
Quote:


20210122, 12:35  #3813 
Quasi Admin Thing
May 2005
3·17·19 Posts 

20210122, 12:53  #3814 
Quasi Admin Thing
May 2005
1711_{8} Posts 
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 
20210122, 13:17  #3815 
"Mark"
Apr 2003
Between here and the
3^{2}·719 Posts 
Can you post your abcd file (7z format) or send via email? I will take a look.

20210122, 14:23  #3816  
"Nuri, the dragon :P"
Jul 2016
Good old Germany
2^{2}×211 Posts 
Quote:
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). 

20210122, 14:47  #3817  
"Mark"
Apr 2003
Between here and the
14507_{8} Posts 
Quote:
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. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Bases 251500 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  2360  20211205 09:00 
Bases 101250 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  946  20211130 15:43 
Bases 33100 reservations/statuses/primes  Siemelink  Conjectures 'R Us  1712  20211128 02:30 
Riesel base 3 reservations/statuses/primes  KEP  Conjectures 'R Us  1128  20211124 17:23 
Bases 632 reservations/statuses/primes  gd_barnes  Conjectures 'R Us  1404  20211102 07:06 