[QUOTE=MisterBitcoin;569218]Did that and still get the Error that he couldnt process the line.



[CODE]base=71
mink=1132000000
maxk=1132052528
c=-1
npgfile=1,1_.log
npgfile=2,2_.log
npgfile=3,3_.log
npgfile=4,4_.log
phase=srsieve,144,30000,300000
phase=srsieve,192,32981,42000
phase=srsieve,240,32976,225000[/CODE]

Thats the ini i am using, just for testing reasons.
(and yes i am using the srbsieve you posted)[/QUOTE]

The phase should be "srsieve2" if you are using srsieve2 and the exe should also be named srsieve2.

[QUOTE=rogue;569219]The phase should be "srsieve2" if you are using srsieve2 and the exe should also be named srsieve2.[/QUOTE]


Still the same.



[CODE]C:\Users\Sydekum\Documents\other stuff\srbsieve_full>srbsieve.exe
Error: Could not process line phase=srsieve2,144,30000,300000[/CODE]

Try this. I modified the logic for how it parses the phase= lines.

[QUOTE=rogue;569269]Try this. I modified the logic for how it parses the phase= lines.[/QUOTE]


I will give this a try after the first batch is done, this should be in 2 days.

That works now, but i think its not that much faster as i have hoped.

[CODE]01/13/21 19:12:33 srsieve started: 1 <= n <= 144, 3 <= p <= 581000
01/13/21 19:14:26 srsieve stopped: at p=581000 because --pmax was reached.[/CODE]srsieve1

[CODE]2021-01-16 16:33:56: Sieve started: 3 < p < 581e3 with 2735928 terms (1 < n < 144, k*7^n+c) (expecting 2509466 factors)
2021-01-16 16:35:58: Sieve completed at p=581047. Primes tested 47612. Found 2368688 factors. 367240 terms remaining[/CODE]

[QUOTE=MisterBitcoin;569445]That works now, but i think its not that much faster as i have hoped.

[CODE]01/13/21 19:12:33 srsieve started: 1 <= n <= 144, 3 <= p <= 581000
01/13/21 19:14:26 srsieve stopped: at p=581000 because --pmax was reached.[/CODE]srsieve1

[CODE]2021-01-16 16:33:56: Sieve started: 3 < p < 581e3 with 2735928 terms (1 < n < 144, k*7^n+c) (expecting 2509466 factors)
2021-01-16 16:35:58: Sieve completed at p=581047. Primes tested 47612. Found 2368688 factors. 367240 terms remaining[/CODE][/QUOTE]

What is the range of k that you were testing?

You will notice a difference if you can use srsieve2cl when maxp > 1e6 (as the GPU logic comes into play at p > 1e6). If you can sieve more deeply with srsieve2cl then the PRP testing steps should be much faster and the PRP steps are where the most time is spent.

[QUOTE=rogue;569470]What is the range of k that you were testing?

You will notice a difference if you can use srsieve2cl when maxp > 1e6 (as the GPU logic comes into play at p > 1e6). If you can sieve more deeply with srsieve2cl then the PRP testing steps should be much faster and the PRP steps are where the most time is spent.[/QUOTE]


With srsieve2 I am now running at k=600M-700M with only 19K´s at once. Both sieve and prp steps take around 2 minutes to 3 minutes.


The server this is running doesnt have any GPU, so this wouldnt come too play. However i am considering to order an GPU server to replace my linux server.

Price would be similiar.

But there isnt any GPU based llr-test software by change? (for this base on top ofc)

It seems like srsieve2 is writing the sieve file sorted by k instead of n. Not that this is a problem, but i just wanted to let you know. :smile:

[QUOTE=MisterBitcoin;569647]It seems like srsieve2 is writing the sieve file sorted by k instead of n. Not that this is a problem, but i just wanted to let you know. :smile:[/QUOTE]

yes, you can use srfile to convert to another file which is sorted. Iam doing that.

[QUOTE=MisterBitcoin;569445]That works now, but i think its not that much faster as i have hoped.

[CODE]01/13/21 19:12:33 srsieve started: 1 <= n <= 144, 3 <= p <= 581000
01/13/21 19:14:26 srsieve stopped: at p=581000 because --pmax was reached.[/CODE]srsieve1

[CODE]2021-01-16 16:33:56: Sieve started: 3 < p < 581e3 with 2735928 terms (1 < n < 144, k*7^n+c) (expecting 2509466 factors)
2021-01-16 16:35:58: Sieve completed at p=581047. Primes tested 47612. Found 2368688 factors. 367240 terms remaining[/CODE][/QUOTE]

srsieve2 will be slower than srsieve for small n (n < 64) because of a primality check it does. If the factor = k*b^n+c, then it will output a message saying that k*b^n+c is prime. I will lower the bounds of this check because it cannot reliably check for primality if k*b^n+c > 2^63.

srsieve2 will be slower than srsieve for smal p because srsieve2 validates factors by default. srsieve will only verify if the -c command line switch is used. This has a noticeable impact when p is small due to the number of terms removed by small p.

[QUOTE=rebirther;569648]yes, you can use srfile to convert to another file which is sorted. Iam doing that.[/QUOTE]

Use -f with srsieve2 to change the format of the output file.