[QUOTE=pepi37;450575]Link to page is?[/QUOTE]

[QUOTE=Jean Penné;450576][URL]https://www.rieselprime.de/[/URL]

Jean[/QUOTE]

That is the website. Here is the web page that I think Jean is referring to:

[URL]https://www.rieselprime.de/Related/LiskovetsGallot.htm[/URL]

[QUOTE=gd_barnes;450620]That is the website. Here is the web page that I think Jean is referring to:

[URL]https://www.rieselprime.de/Related/LiskovetsGallot.htm[/URL][/QUOTE]

That is link I searched for!
Thanks!

[QUOTE=gd_barnes;450620]That is the website. Here is the web page that I think Jean is referring to:

[URL]https://www.rieselprime.de/Related/LiskovetsGallot.htm[/URL][/QUOTE]

Could you add that link and other project status links to [URL="http://www.noprimeleftbehind.net/crus/"]the CRUS home page[/URL]? By "project status links", I mean PRPNet servers, BOINC servers, etc.

[QUOTE=rogue;450631]Could you add that link and other project status links to [URL="http://www.noprimeleftbehind.net/crus/"]the CRUS home page[/URL]? By "project status links", I mean PRPNet servers, BOINC servers, etc.[/QUOTE]

I had it on the base 2 even-n and odd-n main pages for years. But it was not updated for over 4 years so I finally took it off about a year ago. I will put it back there but if it becomes out of date again I will remove it again.

Edit: I have changed the link on the powers-of-2 and reservations pages.

R2, k=9519, tested n=14M to 15M. No prime, continuing...

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 6,901,015 (2,077,923 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 7,001,095 (2,107,544 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 7,100,023 (2,137,324 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 7,327,327 (2,205,750 decimal digits) no prime, continuing...

Best Regards,
Jean

[QUOTE=Jean Penné;456797]Hi,

k=9267 is now tested up to n = 7,327,327 (2,205,750 decimal digits) no prime, continuing...

Best Regards,
Jean[/QUOTE]

Are you testing on a CPU or GPU?

[QUOTE=masser;456841]Are you testing on a CPU or GPU?[/QUOTE]

I am testing on an i7 CPU and using 4 threads.
Regards,
Jean

Thanks, Jean.

I seem to recall that there is a GPU program (llrCUDA or CUDAllr?) for testing k*2^n+/-1 circulating on this forum. Has anyone tried this program for CRUS sequences?

[QUOTE=masser;457012]Thanks, Jean.

I seem to recall that there is a GPU program (llrCUDA or CUDAllr?) for testing k*2^n+/-1 circulating on this forum. Has anyone tried this program for CRUS sequences?[/QUOTE]

You can always try yourself, and then give us yours results and observations :)

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 7,400,983 (2,227,922 decimal digits) no prime, continuing...

Best Regards,

R2, k=9519 tested 15M - 16M, no prime. Continuing to the end of the sieve file which goes up to 16.7M

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 7,601,167 (2,288,184 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 7,707,487 (2,320,189 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 7,804,783 (2,349,478 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 7,901,383 (2,378,558 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 8,000,383 (2,408,360 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 8,109,415 (2,441,182 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 8,200,567 (2,468,621 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 8,300,623 (2,498,741 decimal digits) no prime, continuing...

Best Regards,
Jean

See [URL="http://mersenneforum.org/showthread.php?t=22600"]http://mersenneforum.org/showthread.php?t=22600[/URL], 168451*2^19375200+1 is prime, thus k=168451 can be removed from the remain k's for the Sierpinski 2nd base 2 conjecture.

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 8,406,703 (2,530,674 decimal digits) no prime, continuing...

Best Regards,
Jean

I've updated my [url='https://www.rieselprime.de/Related/LiskovetsGallot.htm']page[/url] with the current ranges.

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 8,504,695 (2,560,173 decimal digits) no prime, continuing...

Thanks to Karsten for the update, and Best Regards,
Jean

Status update
 

R2, k=9519 has passend n=16.5M. Less than 500 tests left. I hope to finish before christmas.

R2, k=9519 finished to 2^24. No prime. Base released. R366 will pick up some speed now...

A few days ago PG found the mega prime
[CODE][FONT=sans-serif]273809*2^8932416-1
[/FONT]
[/CODE][FONT=sans-serif][SIZE=2]
The prime is [/SIZE][/FONT][FONT=sans-serif][SIZE=2]2,688,931 digits long. [/SIZE][/FONT]
[FONT=sans-serif][SIZE=2][URL="http://www.primegrid.com/download/TRP-273809.pdf"]The official letter[/URL]
[/SIZE][/FONT]
[FONT=sans-serif][SIZE=2]
[/SIZE][/FONT]
:bow wave::groupwave::skiing:

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 8,806,303 (2,650,966 decimal digits) no prime, continuing...

Best Regards,
Jean

[QUOTE=Puzzle-Peter;473147]R2, k=9519 finished to 2^24. No prime. Base released. R366 will pick up some speed now...[/QUOTE]

I´ve made an sieve file for this sequence up to N=25M.
The calc prime results are looking good.

[CODE]using base 2, sieve depth 50000000, and reading 781255 candidates from t17_b2_k9519.npg

expected # of primes: 1.7263706830854946
odds of at least one prime: 82.20709997186222%
(or, in other words) 1 in 1.2164399429517392 chance of at least one prime
on average, 1 in 452541.8600156512 candidates should be prime[/CODE]

I´ll input the file into yoyo@home. Not sure if yoyo is going with my pmax=25e15. :smile:

After the file is done, around 03/2018, I´ll go ahead and start some testing. Everyone is welcomed to support.

[QUOTE=MisterBitcoin;476668]I´ve made an sieve file for this sequence up to N=25M.
The calc prime results are looking good.

[CODE]using base 2, sieve depth 50000000, and reading 781255 candidates from t17_b2_k9519.npg

expected # of primes: 1.7263706830854946
odds of at least one prime: 82.20709997186222%
(or, in other words) 1 in 1.2164399429517392 chance of at least one prime
on average, 1 in 452541.8600156512 candidates should be prime[/CODE]I´ll input the file into yoyo@home. Not sure if yoyo is going with my pmax=25e15. :smile:

After the file is done, around 03/2018, I´ll go ahead and start some testing. Everyone is welcomed to support.[/QUOTE]

Please be careful when taking on such large efforts. I seriously doubt that this is correct. Otherwise we would have easily found a prime already.

Are you sieving only the even n? If not, you are outside of the scope of the project.

The easiest way to accomplish sieving even n only for 9519*2^n-1 n=2^24 to n=25M is to sieve base 4 instead for half the n-range; that is sieve 9519*4^n-1 for n=2^12 to n=12.5M.

My guess is that at most, there is a 20% chance of prime for even n for n=2^24-25M. Are you certain that you really want to do this? It would be extremely low priority on our sieving needs at this point.

[QUOTE=gd_barnes;476742]Please be careful when taking on such large efforts. I seriously doubt that this is correct. Otherwise we would have easily found a prime already.

Are you sieving only the even n? If not, you are outside of the scope of the project.

The easiest way to accomplish sieving even n only for 9519*2^n-1 n=2^24 to n=25M is to sieve base 4 instead for half the n-range; that is sieve 9519*4^n-1 for n=2^12 to n=12.5M.

My guess is that at most, there is a 20% chance of prime for even n for n=2^24-25M. Are you certain that you really want to do this? It would be extremely low priority on our sieving needs at this point.[/QUOTE]

I did a file for 9519*2^n-1 and submitted it to yoyo.
But it looks like the number of expected primes was wrong, so I´m dropping this effort.

[QUOTE=MisterBitcoin;476764]I did a file for 9519*2^n-1 and submitted it to yoyo.
But it looks like the number of expected primes was wrong, so I´m dropping this effort.[/QUOTE]

I'm still not sure that you understand.

The number of expected primes that you came up with is likely correct for ALL n but that is not what CRUS needs. You would need to sieve only even n. Sieving 9519*4^n-1 accomplishes that. Plenty of primes have already been found for base 2 k=9519 odd n. 9519*2^1-1, 9519*2^11-1, and 9519*2^15-1 are all prime and those are just the smallest 3 primes.

Regardless the effort is apparently not what you expected so it's best to drop it at this point. Few people want to run tests that take more than 1 day each.

[QUOTE=gd_barnes;476799]

Regardless the effort is apparently not what you expected so it's best to drop it at this point. Few people want to run tests that take more than 1 day each.[/QUOTE]

I do enjoy those long tests, so I started a sieve for n=2^24 to 2^26.

[QUOTE=Puzzle-Peter;477672]I do enjoy those long tests, so I started a sieve for n=2^24 to 2^26.[/QUOTE]

Send me that file, I´ll sieve up to 25e15. :smile:
Either in my "blog" or via the mail I pm´ed you.

Looks like fun- I'll donate at least a haswell-core-month to LLR when the sieve file is ready.

[QUOTE=MisterBitcoin;477679]Send me that file, I´ll sieve up to 25e15. :smile:
Either in my "blog" or via the mail I pm´ed you.[/QUOTE]

Ist this deep enough? You were planning to go to 25e15 for N=25M. This sieve file goes more than twice as high.

[QUOTE=Puzzle-Peter;477687]Ist this deep enough? You were planning to go to 25e15 for N=25M. This sieve file goes more than twice as high.[/QUOTE]

I can also extend the search limit. Since it´s done with yoyo@home I can go as high as you´d like to have it. :)
You might also ask PG, so far I know they did some sieve files with way deeper P´s than yoyo@home would possibly do.

I think you guys are talking about two different things. This communication confuses me so I'm wondering if you guys are understanding one another. :-)

Peter, I believe that you are saying that a larger n-range needs to be sieved. I see that you have started on n=2^24-2^26 (n=16777216 to 67108864). That range vs. the previously suggested range by Bitcoin of n=2^24 to n=25M.

Bitcoin, I believe that you are saying that you can sieve much more deeply as is needed.

...so two different lines of communication.

I do not think that Primegrid would have a sieve file for this n-range. To the best of my knowledge they have only sieved all k<=10000 for n=9M-12M to P=20P (20e15). [They've also done all n<9M to deeper sieve depths.]

To clear things up, Peter, I would suggest that you just send Bitcoin your entire sieve file and he can have Yoyo sieve as deeply as they can. I have no idea what that limit should be but I feel like P=25P (25e15) as suggested by Bitcoin would be a good starting point since it's just low weight even-n.

One more thing to avoid some previous confusion: Please make sure that you guys are only sieving even-n. :-)

This may possibly be the highest n-range ever sieved or factored outside of GIMPS.

So Gary, if I understand correctly can I make "ordinary sieve" on sequence 9519*2^n-1 and then remove all odd candidates from sieve?
If that is true, then GPU can help us alot, since GPU sieve is way faster then CPU sieve.

[QUOTE=pepi37;477708]So Gary, if I understand correctly can I make "ordinary sieve" on sequence 9519*2^n-1 and then remove all odd candidates from sieve?
If that is true, then GPU can help us alot, since GPU sieve is way faster then CPU sieve.[/QUOTE]

Yes. Just sieve to some low limit and then remove all of the odd n's.

Alternatively you can sieve 9519*4^n-1 at half the n-range, i.e. 2^23-2^25 (n=8388608 to 33554432). No n-removal is then needed. But I don't know if a GPU can do anything except base 2.

Coordinate with Peter before doing anything. He has probably already removed odd n's or is sieving base 4. He is the starting point for all of this.

[QUOTE=gd_barnes;477709]Yes. Just sieve to some low limit and then remove all of the odd n's.

Alternatively you can sieve 9519*4^n-1 at half the n-range, i.e. 2^23-2^25 (n=8388608 to 33554432). No n-removal is then needed. But I don't know if a GPU can do anything except base 2.

Coordinate with Peter before doing anything. He has probably already removed odd n's or is sieving base 4. He is the starting point for all of this.[/QUOTE]

Very interesting :)
I will not start anything , dont worry :)
But idea with GPU still stay...

I just sent the file to Mr. Bitcoin, odd n values were removed and P=160e12. As the optimal sieve depth increases with increasing n values I wasn't sure about 25e15. But now I realize it's so much more than what I had for the previous file which went up to n=2^24 I cannot imagine 25e15 to not be enough. Well, we will see.

Any help about using GPUs will be greatly appreciated as nobody wants to waste time.

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 9,003,487 (2,710,324 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 9,200,215 (2,769,545 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 9,400,135 (2,829,727 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 9,602,743 (2,890,718 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 10,003,207 (3,011,270 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 10,136,695 (3,051,454 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 10,301,167 (3,100,965 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 10,501,255 (3,161,197 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 10,703,863 (3,222,188 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd ns
 

Hi,

k=9267 is now tested up to n = 11,299,855 (3,401,600 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 11,605,495 (3,493,607 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

k=9267 is now tested up to n = 11,801,407 (3,552,582 decimal digits) no prime, continuing...

Best Regards,
Jean

Sierpinski odd n's testing
 

Hi,

K=9267 is now tested up to n = 11,999,575 ; no prime found...
The testing on the input file I obtained from Primegrid being now completed, I am now sieving from n = 12,000,000 (now up to 30T only...)

continuing nevertheless...

Regards,
Jean

[QUOTE=Jean Penné;537069]Hi,

K=9267 is now tested up to n = 11,999,575 ; no prime found...
The testing on the input file I obtained from Primegrid being now completed, I am now sieving from n = 12,000,000 (now up to 30T only...)

continuing nevertheless...

Regards,
Jean[/QUOTE]


I have a filed sieved to P=1100T (1.1x10^12) for n=5M-16.777M (2^24) for all of the base 2 even and odd k's and n's that I did for our PRPnet effort that included this k. I thought you were using it. But I guess the PrimeGrid file was sieved much deeper.

Attached is the relevant portion of the file. I don't know if you'll want to sieve it more. Probably not with so few testing candidates left.

[QUOTE=gd_barnes;537102]I have a filed sieved to P=1100T (1.1x10^12) for n=5M-16.777M (2^24) for all of the base 2 even and odd k's and n's that I did for our PRPnet effort that included this k. I thought you were using it. But I guess the PrimeGrid file was sieved much deeper.

Attached is the relevant portion of the file. I don't know if you'll want to sieve it more. Probably not with so few testing candidates left.[/QUOTE]

Many thanks, Gary, I shall use it as soon as possible!
Jean

[QUOTE=Jean Penné;537195]Many thanks, Gary, I shall use it as soon as possible!
Jean[/QUOTE]

If you need we can send Gary sieve file to additional sieving to Yoyo

[QUOTE=pepi37;537209]If you need we can send Gary sieve file to additional sieving to Yoyo[/QUOTE]

Thank you by advance!
I will inform you if the testing of the file I got from Gary becomes also completed, but it will be a long time before that arrives!

Regards,
Jean

Sierpinski odd n's testing
 

Hi,

K=9267 is now tested up to n = 12,202,735 ; no prime found...
I am continuing with this input file sent to me by Gary.
Regards,
Jean

Sierpinski odd n's testing
 

Hi,

K=9267 is now tested up to n = 12,401,815 ; no prime found...
I am continuing with this input file sent to me by Gary.
Regards,
Jean

I've created a [url='https://www.rieselprime.de/ziki/CRUS_Liskovets-Gallot']page[/url] in the Wiki for these conjectures with links to the k-values.
Almost no history yet available for the k-values or primes found so far but will come.
Also not yet included even k-values/base-4.

Sierpinski odd n's testing
 

Hi,

K=9267 is now tested up to n = 12,600,343 ; no prime found...
I am continuing with this input file sent to me by Gary.
Regards,
Jean

PrimeGrid will continue their work on the two Sierp base 2 even k's. We will remove tests for n>6.625M from our PRPnet server port 1400 and PrimeGrid will take it from there. The k's are:

90646*2^n+1
101746*2^n+1

I will eventually post a link to PrimeGrid's status page for these two k's on our web pages.

Sierpinski odd n's testing
 

Hi,

K=9267 is now tested up to n = 12,810,415 ; no prime found...
I am continuing with this input file sent to me by Gary.
Regards,
Jean

PrimeGrid released k=90646 and 101746 at n=10M. They are now available.

BOINC will take over all of the remaining unreserved k's here.

Sierpinski odd n's testing
 

Hi,

K=9267 is now tested up to n = 13,002,247 ; no prime found...
I am continuing with this input file sent to me by Gary.
Regards,
Jean

Sierpinski odd n's testing
 

Hi,

K=9267 is now tested up to n = 13,206,223 ; no prime found...
I am continuing with this input file sent to me by Gary.
Regards,
Jean

Reserving S2 odd-n to n=8M (6.65-8M) for BOINC

Reserving R2 odd-n to n=8M (6.65-8M) for BOINC

R2 2nd conjecture is at n=1.5M; 5 primes were found for n=1M-1.5M shown below; 40 k's remain; continuing to n=2M.

Primes:
737797*2^1002029-1
664273*2^1122271-1
667841*2^1333638-1
748931*2^1344062-1
691303*2^1482111-1

My residual reservation on the R2 [I]k[/I]'s 671413, 685183, 686711, and 700057 (all of which belong to the R2 second conjecture) has been completed between [I]n[/I]=900k-1M. No primes found, and I'm releasing them to CRUS. I don't know if Gary included them in the above range.

[QUOTE=Happy5214;583906]My residual reservation on the R2 [I]k[/I]'s 671413, 685183, 686711, and 700057 (all of which belong to the R2 second conjecture) has been completed between [I]n[/I]=900k-1M. No primes found, and I'm releasing them to CRUS. I don't know if Gary included them in the above range.[/QUOTE]


Thanks for the info. That makes the # of k's remaining official. I had not tested your range for n=900K-1M but I did include them in the search for n=1M-2M as well as in the # of k's remaining. All 4 of them were so low weight I just went on the assumption that there would not be a prime for n=900K-1M...and none have had a prime up to n=1.5M+ so far. :-)

After you update the Wiki to show them complete to n=1M I will reserve them for this effort and show them at n=1.5M.

[QUOTE=gd_barnes;583910]After you update the Wiki to show them complete to n=1M I will reserve them for this effort and show them at n=1.5M.[/QUOTE]

I just went ahead and added your reservations (in the form of the 2nd Riesel Problem multi-reservation) to the four [I]k[/I] pages myself when I released them, as well as the progress to [I]n[/I]=1.5M, so you shouldn't have to do anything extra on the wiki. Good luck with them!

Great, thanks!