Use this [url]http://www.primegrid.com/stats_psp_llr.php[/url]

Not this [url]http://www.primegrid.com/stats_psp_llr.php/[/url]

Lennart

[QUOTE=Lennart;314030]Use this [url]http://www.primegrid.com/stats_psp_llr.php[/url]

Not this [url]http://www.primegrid.com/stats_psp_llr.php/[/url]

Lennart[/QUOTE]

Gary can edit that.

Is something wrong with PRPNet port 13005? It isn't responding.

[QUOTE=rogue;314033]Gary can edit that.

Is something wrong with PRPNet port 13005? It isn't responding.[/QUOTE]

Strange... It is working here...


Lennart

[QUOTE=Lennart;314034]Strange... It is working here...

Lennart[/QUOTE]

Odd. It's working now. It wasn't working when I tried it earlier.

I'll have to look for precise data, but I think I sieved my range to p=500T or even higher.

Presieved files updated
 

Hi,

I updated today my 13 remaining active presieved files ; They are now sieved up to 65T.

Please, let me know if continuing to sieve these files further using sr2sieve is still useful...

Best Regards,
Jean

[QUOTE=Jean Penné;314083]I updated today my 13 remaining active presieved files ; They are now sieved up to 65T.

Please, let me know if continuing to sieve these files further using sr2sieve is still useful...[/QUOTE]

Thanks Jean.

Have you done any testing with ppsieve to see if it is any faster than sr2sieve? Not that ppsieve might not be very fast for the larger k.

PrimeGrid has probably sieved 9519*2^n-1 and 9267*2^n+1 to well over 3T by this time. It might take a while to pull out the k/n combinations with factors, but it would probably save time and nobody would need to sieve them any deeper.

[QUOTE=rogue;314089]Thanks Jean.

Have you done any testing with ppsieve to see if it is any faster than sr2sieve? Not that ppsieve might not be very fast for the larger k.

PrimeGrid has probably sieved 9519*2^n-1 and 9267*2^n+1 to well over 3T by this time. It might take a while to pull out the k/n combinations with factors, but it would probably save time and nobody would need to sieve them any deeper.[/QUOTE]

I did not use ppsieve until now... Is it possible to sieve several k's simultaneously, like with sr2sieve, and, if yes, how to do that?
Also, I am still sieving 9267*2^n+1, but not 9519*2^n-1

Regards,
Jean

[QUOTE=Jean Penné;314153]I did not use ppsieve until now... Is it possible to sieve several k's simultaneously, like with sr2sieve, and, if yes, how to do that?
Also, I am still sieving 9267*2^n+1, but not 9519*2^n-1[/QUOTE]

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.

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.

ppsieve for several k's
 

Hi Mark and Karsten,

Many thanks for your help! Presently, my 4-core Linux machine is totally busy, so I will continue some time with sr2sieve...

Regards,
Jean