mersenneforum.org Bases 501-1030 reservations/statuses/primes
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2021-01-15, 17:46 #3807 rebirther     Sep 2011 Germany 5·557 Posts Reserving S504 to n=300k (250-300k) for BOINC
 2021-01-21, 17:29 #3808 KEP Quasi Admin Thing     May 2005 2·3·7·23 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
2021-01-21, 19:01   #3809
rogue

"Mark"
Apr 2003
Between here and the

18A116 Posts

Quote:
 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.

2021-01-21, 19:42   #3810
KEP
Quasi Admin Thing

May 2005

2·3·7·23 Posts

Quote:
 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

2021-01-21, 20:30   #3811
gd_barnes

May 2007
Kansas; USA

2×71×73 Posts

Quote:
 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?

2021-01-21, 21:15   #3812
rogue

"Mark"
Apr 2003
Between here and the

18A116 Posts

Quote:
 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.

2021-01-22, 12:35   #3813
KEP
Quasi Admin Thing

May 2005

96610 Posts

Quote:
 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

2021-01-22, 12:53   #3814
KEP
Quasi Admin Thing

May 2005

2·3·7·23 Posts

Quote:
 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

 2021-01-22, 13:17 #3815 rogue     "Mark" Apr 2003 Between here and the 5·13·97 Posts Can you post your abcd file (7z format) or send via e-mail? I will take a look.
2021-01-22, 14:23   #3816
MisterBitcoin

"Nuri, the dragon :P"
Jul 2016
Good old Germany

14468 Posts

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

2021-01-22, 14:47   #3817
rogue

"Mark"
Apr 2003
Between here and the

5×13×97 Posts

Quote:
 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.

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post gd_barnes Conjectures 'R Us 898 2021-05-08 18:09 gd_barnes Conjectures 'R Us 2281 2021-04-26 18:08 KEP Conjectures 'R Us 1098 2021-04-18 21:07 gd_barnes Conjectures 'R Us 1432 2021-04-17 15:07 Siemelink Conjectures 'R Us 1682 2021-04-13 23:50

All times are UTC. The time now is 11:50.

Tue May 11 11:50:00 UTC 2021 up 33 days, 6:30, 1 user, load averages: 2.16, 2.27, 2.26

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.