Reserving R525 as new base using the newbase script up to 2.5k and sieving to 10k (1G) with srsieve2

R667 is complete to n=300K; no primes were found for n=250K300K; 2 k's still remain; base released.

R525 tested to n=2.5k + sieved to 1G (2.510k)
53207 remain Results emailed  Base released 
R926 tested to n=300k (200300k)
nothing found, 6 remain Results emailed  Base released 
Reserving S535 as new base using the newbase script up to 2.5k and sieving to 10k (1G) with srsieve2

S994 tested to n=200k (100200k)
2 primes found, 5 remain Results emailed  Base released 
S535 tested to n=2.5k + sieved to 1G (2.510k)
35050 remain Results emailed  Base released 
Reserving R817 as new base using the newbase script up to 2.5k and sieving to 10k (1G) with srsieve2

Reserving S520 to n=1M (700k1M) for BOINC

R817 tested to n=2.5k + sieved to 1G (2.510k)
74092 remain Results emailed  Base released 
Reserving R715 as new base using the newbase script up to 2.5k and sieving to 10k (1G) with srsieve2

R715 tested to n=2.5k + sieved to 1G (2.510k)
14622 remain Results emailed  Base released 
1 Attachment(s)
R712 is at n=726K with around 1 hour and 40 minutes runtime, its slowly processing. I will focus on this one more, extending reservation up to 800K.
I added all of results again, since i dont realy know when i posted an update on it. 
Reserving S915 as new base using the newbase script up to 2.5k and sieving to 10k (1G) with srsieve2

1 Attachment(s)
Took me a bit longer due to an network outage. Sieve file for R1005 is attached.

Reserving S561 to n=25K  IT will not delay my SR383 search, due to the huge upgrade I'm going to order the parts for within the end of today. 2 Ryzen 9 3900X is on the way to work on SR383 :smile:
Doing this test, also shows me the balance of the srbsieve ini files or if tweaking should be recommended. So far, going to n=3076 it appears that the sievelevel is sane and in line with what should be, wich shows that if theory is sound, it also turns out to be practical. I'll double check the primes, using PFGW with a1. The ini file took about 8 CPU days, going to n=2500 on an i5 4670 using srbsieve. 
[QUOTE=KEP;568292]Reserving S561 to n=25K  IT will not delay my SR383 search, due to the huge upgrade I'm going to order the parts for within the end of today. 2 Ryzen 9 3900X is on the way to work on SR383 :smile:
Doing this test, also shows me the balance of the srbsieve ini files or if tweaking should be recommended. So far, going to n=3076 it appears that the sievelevel is sane and in line with what should be, wich shows that if theory is sound, it also turns out to be practical. I'll double check the primes, using PFGW with a1. The ini file took about 8 CPU days, going to n=2500 on an i5 4670 using srbsieve.[/QUOTE] Good luck with the new machines! :) Please post a status with primes and k's remaining when you reach n=5K and again at n=10K. Thanks. 
[QUOTE=gd_barnes;568293]Good luck with the new machines! :)
Please post a status with primes and k's remaining when you reach n=5K and again at n=10K. Thanks.[/QUOTE] Thank you, they are most wanted and has been for a long time :smile: I sure will post at n=5K and n=10K and if wanted every 5000 n. At n=3172 there is about 10000 k's remaining and about 2,144,000 primes found. It sure amazes me how prime this conjecture is :smile: For the future, I will only use the i5 4670 to starting up bases and untested ranges. Take care and now lets have a very very fortunate 2021 where everything comes back to "normal" :smile: 
S915 tested to n=2.5k + sieved to 1G (2.510k)
61769 remain Results emailed  Base released 
Reserving S793 as new base using the newbase script up to 2.5k and sieving to 10k (1G) with srsieve2

S793 tested to n=2.5k + sieved to 1G (2.510k)
47035 remain Results emailed  Base released 
Reserving S651 as new base using the newbase script up to 2.5k and sieving to 10k (1G) with srsieve2

S651 tested to n=2.5k + sieved to 1G (2.510k)
13808 remain Results emailed  Base released 
Reserving S504 to n=300k (250300k) for BOINC

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 :smile: 
[QUOTE=KEP;569781]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 :smile:[/QUOTE] Definitely use srsieve2cl if you have a good enough GPU. 
[QUOTE=rogue;569784]Definitely use srsieve2cl if you have a good enough GPU.[/QUOTE]
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 :smile: 
[QUOTE=KEP;569781]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 :smile:[/QUOTE] Can you please post the primes and k's remaining? 
[QUOTE=KEP;569787]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 :smile:[/QUOTE]
Hmm. Maybe too many sequences to handle at one time. 
[QUOTE=gd_barnes;569790]Can you please post the primes and k's remaining?[/QUOTE]
Primes and k's remaining is emailed to you :smile: 
[QUOTE=rogue;569791]Hmm. Maybe too many sequences to handle at one time.[/QUOTE]
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 
Can you post your abcd file (7z format) or send via email? I will take a look.

[QUOTE=KEP;569825]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[/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). :ermm: 
[QUOTE=MisterBitcoin;569834]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). :ermm:[/QUOTE] 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. 
@rogue: Do you have a guide how much VRAM will be used for x sequences with the srsieve2cl?

[QUOTE=rogue;569836]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.[/QUOTE] Thats a puzzle, shouldnt it start at p=37G in stead of p=0? Good you figured it out. 
[QUOTE=KEP;569858]Thats a puzzle, shouldnt it start at p=37G in stead of p=0?[/QUOTE]
If you didn't provide p on the command line and it isn't in the input file, it will start at p=0. Did I misunderstand your question? 
[QUOTE=rebirther;569839]@rogue: Do you have a guide how much VRAM will be used for x sequences with the srsieve2cl?[/QUOTE]
The code does capture the number of bytes it allocates in GPU memory needed for kernel arguments. I could modify the code to print that out when using H. 
[QUOTE=rogue;569861]If you didn't provide p on the command line and it isn't in the input file, it will start at p=0. Did I misunderstand your question?[/QUOTE]
Maybe I wasn't clear, I'm having too many balls in the air at the moment and the building of my 2 new machines turned out due to a human error (made by me) to be far more than a walk in the park. The question was, as you could see in my copy paste of CMD prompt window of what in fact happens, that I used this flag "p 37684705039" and therefor that should be the starting value of p, but it appears that srsieve2cl still started at p=0, is that correct or did I missread the outputs that was printed on the screen? :smile: ... Does the use of W x somehow interfere with the p setting? 
[QUOTE=KEP;569875]Maybe I wasn't clear, I'm having too many balls in the air at the moment and the building of my 2 new machines turned out due to a human error (made by me) to be far more than a walk in the park.
The question was, as you could see in my copy paste of CMD prompt window of what in fact happens, that I used this flag "p 37684705039" and therefor that should be the starting value of p, but it appears that srsieve2cl still started at p=0, is that correct or did I missread the outputs that was printed on the screen? :smile: ... Does the use of W x somehow interfere with the p setting?[/QUOTE] The issue is with W in srsieve2cl. If you remove W and have a single GPU worker and you only see p=0, then there could be a problem. 
S504 tested to n=300k (250300k)
nothing found, 3 remain Results emailed  Base released 
Reserving S516 to n=600k (400600k) for BOINC
Reserving S534 to n=600k (400600k) for BOINC Reserving S574 to n=600k (400600k) for BOINC Reserving S579 to n=600k (400600k) for BOINC Reserving S582 to n=600k (400600k) for BOINC Reserving S596 to n=600k (400600k) for BOINC 
1 Attachment(s)
[QUOTE=MisterBitcoin;567745]R712 is at n=726K with around 1 hour and 40 minutes runtime, its slowly processing. I will focus on this one more, extending reservation up to 800K.
I added all of results again, since i dont realy know when i posted an update on it.[/QUOTE] Testing reached n=800K. No primes found, results attached. Releasing this base. 
Reserving S605 to n=600k (400600k) for BOINC
Reserving S649 to n=600k (400600k) for BOINC Reserving S676 to n=600k (400600k) for BOINC 
S520 tested to n=1M (700k1M)
nothing found, 1 remain Results emailed  Base released 
Reserving S976 as new base using the newbase script up to 2.5k and sieving to 10k (1G) with srsieve2

S976 tested to n=2.5k + sieved to 1G (2.510k)
48740 remain Results emailed  Base released 
Cancel of S561 reservation
I'm sory to have to inform, that my i54670 has breathed its last breath. Today I tried gaining access to the HDD containing the produced S561 data  the drive is not running and I start to fear that the distinct smell of wires burning has affected the HDD too. As a result thereof, I unfortunantly has to retract my S561 reservation.
Good thing is, that only minor work has been lost on base 383 and only for the 12 highest k's. It may be as little as 1 day or as much as 1 week for the 2 Ryzens to redo. Fortunantly I took a safety copy of my i54670 between christmas and new year. Most time since last backup, has been used on S561 and little time on the Twin Conjecture. I'm not sure how much has been lost of the SG conjecture or if anything has been lost of the Twin Conjecture  the most likely loss for the Twin conjecture is minor (if any) and most likely for the SG conjecture it is catastrophic. Have a nice one everyone and sorry for the inconvieanience :smile: 
Reserving S577 to n=300k (200300k) for BOINC

S516 tested to n=600k (400600k)
nothing found, 1 remain Results emailed  Base released 
S534 tested to n=600k (400600k)
nothing found, 1 remain Results emailed  Base released 
S574 tested to n=600k (400600k)
nothing found, 1 remain Results emailed  Base released 
Reserving S625 to n=300k (200300k) for BOINC

S605 tested to n=600k (400600k)
nothing found, 1 remain Results emailed  Base released 
Reserving S886 as new base using the newbase script up to 2.5k and sieving to 10k (1G) with srsieve2

S577 tested to n=300k (200300k)
nothing found, 6 remain Results emailed  Base released 
S676 tested to n=600k (400600k)
1 prime found, base proven Results emailed  Base released 
S886 tested to n=2.5k + sieved to 1G (2.510k)
142454 remain Results emailed  Base released 
Reserving S631 as new base using the newbase script up to 2.5k and sieving to 10k (1G) with srsieve2

S579 tested to n=600k (400600k)
nothing found, 1 remain Results emailed  Base released 
S582 tested to n=600k (400600k)
nothing found, 1 remain Results emailed  Base released 
S596 tested to n=600k (400600k)
nothing found, 1 remain Results emailed  Base released 
S631 tested to n=2.5k + sieved to 1G (2.510k)
28048 remain Results emailed  Base released 
Reserving S653 to n=300k (200300k) for BOINC
Reserving S762 to n=300k (200300k) for BOINC Reserving S686 to n=600k (400600k) for BOINC Reserving S702 to n=600k (400600k) for BOINC Reserving S707 to n=600k (400600k) for BOINC 
S649 tested to n=600k (400600k)
nothing found, 1 remain Results emailed  Base released 
Taking S988.

I started S1020 as a new base with srbsieve/fbncsieve/srsieve2cl. Not certain how far I will take it.

Reserving S994 to n=300k (200300k) for BOINC

S653 tested to n=300k (200300k)
nothing found, 4 remain Results emailed  Base released 
S762 tested to n=300k (200300k)
nothing found, 5 remain Results emailed  Base released 
S686 tested to n=600k (400600k)
nothing found, 1 remain Results emailed  Base released 
S702 tested to n=600k (400600k)
nothing found, 1 remain Results emailed  Base released 
S707 tested to n=600k (400600k)
nothing found, 1 remain Results emailed  Base released 
S625 tested to n=300k (200300k)
3 primes found, 23 remain Results emailed  Base released 
S994 tested to n=300k (200300k)
nothing found, 5 remain Results emailed  Base released 
Reserving R536 to n=200k (100200k) for BOINC
Reserving R558 to n=200k (100200k) for BOINC Reserving R567 to n=200k (100200k) for BOINC 
Reserving S529 to n=200k (100200k) for BOINC

Reserving R650 from 400K to 500K

R536 tested to n=200k (100200k)
nothing found, 10 remain Results emailed  Base released 
R558 tested to n=200k (100200k)
2 primes found, 7 remain Results emailed  Base released 
Reserving R641 to n=200k (100200k) for BOINC
Reserving R654 to n=200k (100200k) for BOINC 
R567 tested to n=200k (100200k)
1 prime found, 8 remain Results emailed  Base released 
Reserving R709 to n=200k (100200k) for BOINC

S529 tested to n=200k (100200k)
1 prime found, 9 remain Results emailed  Base released 
Reserving S572 to n=200k (100200k) for BOINC

1 Attachment(s)
S988 completed to n=300000 and released. No new primes founds

Reserving S572, S639, and S908.

[QUOTE=rogue;579873]Reserving S572, S639, and S908.[/QUOTE]
I have already reserved S572 and running 
[QUOTE=rebirther;579879]I have already reserved S572 and running[/QUOTE]
Good to know. Fortunately I haven't started yet on that conjecture. I had d/l'ed the sieve file days ago and had intended to post as soon as S988 was done. That took a few days longer than anticipated, so you beat me to the punch. 
R654 tested to n=200k (100200k)
1 prime found, 9 remain Results emailed  Base released 
Reserving R722 to n=200k (100200k) for BOINC
Reserving R744 to n=200k (100200k) for BOINC 
R641 tested to n=200k (100200k)
1 prime found, 8 remain Results emailed  Base released 
[URL="https://primes.utm.edu/primes/page.php?id=132360"]4*650^4981011[/URL] is prime!
R 650 solved Base released! 
1174*639^123735+1 is prime.
I am out of town for a couple of weeks, so hopefully I will have other primes to report when I return. 
S572 tested to n=200k (100200k)
nothing found, 9 remain Results emailed  Base released 
Reserving S698 to n=200k (100200k) for BOINC
Reserving S832 to n=500k (400500k) for BOINC 
Reserving S773 up to 350K

All times are UTC. The time now is 07:46. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2023, Jelsoft Enterprises Ltd.