Would it be possible to reserve a range of 1K n on Riesel 320 (to n=26K). I'd like to see how quickly I can do these before I go in for a bigger reservation.

[QUOTE=G30ffr3y;279618]Would it be possible to reserve a range of 1K n on Riesel 320 (to n=26K). I'd like to see how quickly I can do these before I go in for a bigger reservation.[/QUOTE]

Hi G30ffr3y, welcome to CRUS! If you have any questions about running the conjectures or the software used, let us know.

Yes, sure. Go ahead and test the range of n=25K-26K for Riesel base 320 to see how long it will take. I'll mark you down for it. When done, please attach the lresults.txt or pfgw.out file and/or feel free to reserve a larger n-range if you think you would like to.


Gary

Serge has reported completion of S461 to n=250K. The base is released.

The range of 1K took approx 30mins (15 mins sieve, 15 mins prp). The range up to 50K will take about 1 day (?) So can I reserve up to 50K.

[QUOTE=G30ffr3y;279697]The range of 1K took approx 30mins (15 mins sieve, 15 mins prp). The range up to 50K will take about 1 day (?) So can I reserve up to 50K.[/QUOTE]

Welcome to CRUS!
Here's some :blahblah: that you might find to be useful information. :smile:
Note that sieving is more efficient when you search over a larger range. As a rule of thumb, you should aim for a sieve removal rate that equals the PRP test time of a candidate 60% (IIRC) through the range (e.g. for 26K-50K, 60% through is n=40400, so time your computer doing a PRP, or a portion of one, at a k in the middle of the group to get your target removal rate). Due to the nature of CRUS searches, in which you stop searching a k once a prime is found for that k, the maximum n range you usually want to sieve at once is about twice the current search limit, so sieving 26K-50K would work well.
Also remember that the time per candidate will roughly quadruple when the n doubles. Given that, a naive extrapolation (30 min * 24) would suggest 12 hours, so 1 day seems like a decent estimate.

They were largely the numbers I was looking at, though i wasn't sure of what time to sieve up to, so thanks. I suppose though that the time to sieve to the length of the top candidates wouldnt be too great at this level though.
I wasn't sure about the complexity of prping, but i figured it wad unlikely to be much worse than n^2.
Of course, if i find a prime, ill be done much quicker :w00t:

G30ffr3y,

OK, I'll put you down as reserved for R320 to n=50K.

If using PFGW, please be sure and use the -l switch. That will write out the results to pfgw.out. If using LLR, it will automatically write out the lresults.txt file. We need one of those files when you are done.


Thanks,
Gary

Reservations
 

Reserving the following 1kers to n=200K.

R258 R321 R328 R333
S328 S341 S476 S480

[QUOTE=MyDogBuster;279852]Reserving the following 1kers to n=200K.

R258 R321 R328 R333
S328 S341 S476 S480[/QUOTE]

What? No 1kers for bases 200 to 256 ? :smile:

[QUOTE]What? No 1kers for bases 200 to 256 ? :smile:[/QUOTE]

Sieving them now. Didn't have any left over from my last foray.

Note: I'll reserve R333 to 250K because the posted sieve file goes that high.

[QUOTE=MyDogBuster;279872]Sieving them now. Didn't have any left over from my last foray.

Note: I'll reserve R333 to 250K because the posted sieve file goes that high.[/QUOTE]

I planned to take R333 to n=250K and I've sieved it to ~40Т. Because of a lack of resources I haven't reserved it yet, so I can share this file if needed.