From what I have read, I would not recommend ppsieve for sieving the even-k/even-n/odd-n effort. We can use the Primegrid ppsieve files for the two k's < 10000.

[QUOTE=gd_barnes;314185]From what I have read, I would not recommend ppsieve for sieving the even-k/even-n/odd-n effort. We can use the Primegrid ppsieve files for the two k's < 10000.[/QUOTE]

The main challenge is pulling all of the data together to find the remaining n to be tested, but it would be worth the effort and any sieving for those k could be suspended.

[QUOTE=kar_bon;314168]I've used a small to base-2 converted abcd-format file of the npg-files (attached) and run ppsieve with:

[code]
ppsieve-x86-windows.exe -p10000G -P10020G -isr_2.abcd -t4 -q -R -ffac.txt
[/code]

-p starting p-value
-P ending p-value
-i input-file
-t4 4 threads
-q quiet
-R Riesel-sieve format
-f factors-file

Needs much mem, so I can't test the whole file.

To convert from base-4 to base-2 use (g)awk:

[code]
gawk "{print $1\" \"$2*2}" all4.txt >all2.txt
[/code]

where all4.txt contains all base-4 pairs in npg-format without the header line.[/QUOTE]

What sieving rate did you get and on what GPU?

[QUOTE=rogue;314193]The main challenge is pulling all of the data together to find the remaining n to be tested, but it would be worth the effort and any sieving for those k could be suspended.[/QUOTE]

You lost me there. If you can figure out how to pull it all together and sieve it in a more efficient fashion using ppsieve, be my guest. Note that we would only be interested in the even-k, even-n, and odd-n k's (18 k's total). All of the other k's that you showed in your original post that include Prime Sierpinski and Extended Sierpinski k's would not be worked on here.

[QUOTE=gd_barnes;314198]You lost me there. If you can figure out how to pull it all together and sieve it in a more efficient fashion using ppsieve, be my guest. Note that we would only be interested in the even-k, even-n, and odd-n k's (18 k's total). All of the other k's that you showed in your original post that include Prime Sierpinski and Extended Sierpinski k's would not be worked on here.[/QUOTE]

I'm referring only to the k < 10000 in post 234. The factors for n < 9M are available, but one has to grab all of the factor files, then use srfile to eliminate candidates from the abcd file.

Sierpinski even n's
 

Hi,

Please, would you again reserve k=23451 for me ; I want to continue to test it starting now from n=2,000,000 base two.

Thanks by advance and Best Regards,

Jean

[QUOTE=gd_barnes;314185]From what I have read, I would not recommend ppsieve for sieving the even-k/even-n/odd-n effort. We can use the Primegrid ppsieve files for the two k's < 10000.[/QUOTE]
I would like to reserve 9267*2^n+1. Where I can find sieve file from Primegrid for this k?

[QUOTE=unconnected;314806]I would like to reserve 9267*2^n+1. Where I can find sieve file from Primegrid for this k?[/QUOTE]

It isn't quite that easy. You will need to get the abcd file then get all of the factor files. You should start [URL="http://www.primesearchteam.com"]here[/URL], but Lennart might help you achieve your goal faster.

[QUOTE=rogue;314161]Yes, you can sieve multiple k's at once, but ppsieve will sieve all odd k between the upper and lower bound of your input file. ppsieve is limited to base 2, so your files would need to be modified to base 2 before running them with ppsieve. You could probably modify ppsieve to only log factors for the k that you care about or just pull them out of the factors file that is created.[/QUOTE]


I can get the file but it is with all n! not only odd n.

Also need start n end n.

Lennart

[QUOTE=Lennart;314822]I can get the file but it is with all n! not only odd n.

Also need start n end n.[/QUOTE]

I had forgotten that, but that should be easily addressed with an editor.

n from 2M to whatever limit PrimeGrid is sieving. Posting a file here would be fine. I assume that unconnected won't work on it indefinitely. In other words, if someone else decides to extend, they will have a good place to start.

[QUOTE=rogue;314864]I had forgotten that, but that should be easily addressed with an editor.

n from 2M to whatever limit PrimeGrid is sieving. Posting a file here would be fine. I assume that unconnected won't work on it indefinitely. In other words, if someone else decides to extend, they will have a good place to start.[/QUOTE]

I just thought about the search. In PG we search for that k right now. We will stop at 1 030 000 and move to lower k's with higher n's.

I could load that k up to 2M maybe 3M and have it done a bit faster.

Thoughts ?

Lennart


PS: I need a answer today because we will hit 1 030 000 tonight :)