Bases 251-500 reservations/statuses/primes

[VBCurtis]

I really appreciate the detailed explanation! Thank you.

I was planning on enrolling a second laptop core to finish to 2500 sooner than 90 days, and was expecting 4-6 desktop cores of over double the laptop's Ghz for 2500-10k. Sounds like 10x the hardware is not nearly enough for 10k 3 months after 2500!

Perhaps I'll get to n=5000 and call it good. We'll see.

My estimate went something like "10k is four times higher than 2500, so tests take 16x longer. But there will only be half as many k's, so 8x the hardware ought to do it!"

Naturally, that ignores the increased length of the range, as you so nicely detailed.

[KEP]

Originally Posted by VBCurtis

I'm playing with srbsieve sieve & phase settings, so I may find some more speed; I'm trying 5 phases this time rather than 4 last time, for instance. 15 is far too many! Also, I sieve deeper than 78e6 on the last two phases; perhaps I'll try a bit less sieving to see if overall speed improves.

First up, please tell me that you did only 6 sieves, for the entire k range, using NewPGen? ... you ARE WASTING ressources if you sieve only 1M k's and then continue sieve the other ranges. SRBsieve does not care if the amount of k's extent beyond the maxK value in the srbsieve.ini file. It sounds reasonable to split your range in multiple million k ranges - however it may as you may have noticed, affect the sievevalue.

There may be room for optimizations, when it comes to the .ini files. The values should, if one decides not to remove any phases, be the most (likely to be) optimal. I did a lot of calculations over the 6 months I worked on these .ini files, most of the calculations were to have optimal sievevalues for each phase for b=1030 and then scale towards any other base. It took a lot of testing but the result was the .ini files, where the sievevalue was determined by amount of tests remaining at a fixed p value and time per test for given base and FFT value.

If you find optimizations, it may be time someone redo the .ini files for the amount of bases remaining untested.

[VBCurtis]

I chose to do 7 NewPGen files for the entire k-range. The 7th file took ~24hr; in light of Gary's warning that this effort would take multiple CPU-years, I figured one day of pretesting wouldn't hurt. Now that I see how fast the first two phases go, it was a bit wasteful, but that's no big deal.

I suppose I could try the default .ini file to see how much faster or slower it is.... I started with a copy that I used for the annual-base work (R2017, R2018, etc); I didn't re-download the original .ini file.

[rebirther]

Reserving S365 to n=300k (200-300k) for BOINC


Reserving R275 to n=600k (400-600k) for BOINC

[KEP]

Originally Posted by VBCurtis

I suppose I could try the default .ini file to see how much faster or slower it is

Great ... Please let me know what you find. The first 2 phases are the most primeproductive and they go very fast on any base with conjectures <1G.

A lot of things has happened to computers since the original ini files were created. Despite the software being almost the same, things might need a tweek, since FFT lengths may have changed and thereby changed the n settings

[rebirther]

Reserving R326 to n=600k (400-600k) for BOINC

Reserving R332 to n=600k (400-600k) for BOINC

Reserving R334 to n=600k (400-600k) for BOINC

[rebirther]

Reserving R453 as new base using the new-base script up to 2.5k and sieving to 10k (1G) with srsieve2

[KEP]

Originally Posted by rebirther

Reserving R453 as new base using the new-base script up to 2.5k and sieving to 10k (1G) with srsieve2

May I ask why you are not using srbsieve for starting up bases? It is multitude of times faster compared to the new-base script ... Must add, the filenames are the same as for the new-base script only difference is that the very small prime n is delt with using NewPGens sieve funktion for fixed b and n and variable k.

[rebirther]

Originally Posted by KEP

May I ask why you are not using srbsieve for starting up bases? It is multitude of times faster compared to the new-base script ... Must add, the filenames are the same as for the new-base script only difference is that the very small prime n is delt with using NewPGens sieve funktion for fixed b and n and variable k.

Thats easier for me to handle, the rest will be BOINCed in the future.

[gd_barnes]

S376 is complete to n=300K; no primes were found for n=250K-300K; 2 k's still remain; base released.

[kar_bon]

Reserving R255 for n=25k-100k