Riesel base 3 reservations/statuses/primes

[rogue]

Originally Posted by pepi37

KEP
I do test on 13000014446*3^n-1 at 50 K and on 4GHz Intel LLR time is 2.68 seconds
So sieve will be fast because it is easy to sieve to the point where exclusion rate is 3 seconds or more.

If I take for example 1000 candidates on 12 cores then it is easy to give each core 84 K and start LLR .

If this can help your effort I will be glad to help.
Of course in mean time I will stop all my activities on reserved CRUS base ( but I assume nobody will blame me for that)
All is effort :)

So the question will be "how long will that take". Your result would have to be multiplied by 3000 (12 * 250) to know how many CPU core days it would take to get that range to n=50000.

[pepi37]

I took first 1000 candidates and make sieve up to 10000000
There is nearly 890000 candidates left
Since test at 50 K is about 2.6 second, average test will be lower ( lets say 1.8 second)
First I got problem to make sr2sieve do work with such long K ( first is 13000014446*3^n-1)
If I overcome this problem that I could sieve much deeper and expect to remove at least 100000 candidates.
So final number will be about 790000 candidates to left
Even if I not found any , so if I test all them it will be done in

790000* 1.8 second= 1422000 seconds /3600/24/12 = is about 1.37 days to complete

[KEP]

Originally Posted by pepi37

I took first 1000 candidates and make sieve up to 10000000
There is nearly 890000 candidates left
Since test at 50 K is about 2.6 second, average test will be lower ( lets say 1.8 second)
First I got problem to make sr2sieve do work with such long K ( first is 13000014446*3^n-1)
If I overcome this problem that I could sieve much deeper and expect to remove at least 100000 candidates.
So final number will be about 790000 candidates to left
Even if I not found any , so if I test all them it will be done in

790000* 1.8 second= 1422000 seconds /3600/24/12 = is about 1.37 days to complete

Pepi, I'm glad that you want to help out. But please start working at k>21G, since R3 k=13G to k=21G is already tested to n=32600 and will continue to test on my machine untill n=100K is reached. Currently n=30K-40K is being tested and afterwards I might run n=40K-50K if further sieving isn't needed. Also Pepi, please remember that sr2sieve cannot be used on these high k's as you may already have read in my PM reply to you

[VBCurtis]

Originally Posted by pepi37

I took first 1000 candidates and make sieve up to 10000000
There is nearly 890000 candidates left
Since test at 50 K is about 2.6 second, average test will be lower ( lets say 1.8 second)
First I got problem to make sr2sieve do work with such long K ( first is 13000014446*3^n-1)
If I overcome this problem that I could sieve much deeper and expect to remove at least 100000 candidates.
So final number will be about 790000 candidates to left
Even if I not found any , so if I test all them it will be done in

790000* 1.8 second= 1422000 seconds /3600/24/12 = is about 1.37 days to complete

On this sieve you made, did you set n from 25k to 100k, or from 25k to 50k? 25 to 100 is the standard we're using on R3, to reduce the variety of regions/levels tested.

Now that you know 1000 k's takes not long at all, how about tackling a 1G range from 25k to 100k? You don't need your entire 12-thread machine for it, just one core to sieve and then a core or two for LLR. Maybe a month per 1G range on a single core?

As KEP observed, sr2sieve is limited to k's less than 2^32 (~4G), with square-free part of k less than 2^31. This is why I have a region testing on BOINC from 1G to 2.147G; that's 2^31. 0-2.147G will sieve on sr2, higher regions must use srsieve (unless someone is willing to fish out the k's from 2^31 to 2^32 with square-free parts below 2^31!!).

[Puzzle-Peter]

Originally Posted by KEP

I really wish that more people would join the effort and start working the range n=25K-100K on their own computers using LLR.

I'll be joining in about a week or so, I'm pretty clogged up at the moment.

[KEP]

Originally Posted by VBCurtis

Now that you know 1000 k's takes not long at all, how about tackling a 1G range from 25k to 100k? You don't need your entire 12-thread machine for it, just one core to sieve and then a core or two for LLR. Maybe a month per 1G range on a single core?

I actually also thinks that Gary would prefer a 1G range reservation. A conjecture, big as R3, where all k's remaining cannot be run in a single sieve and reservation, it is preferable to run such a conjecture in a 1G range per core or computer (dependant on the choice of the user).

[KEP]

Originally Posted by Puzzle-Peter

I'll be joining in about a week or so, I'm pretty clogged up at the moment.

Now see that is very cool news

[Puzzle-Peter]

I'm not used to the small stuff any more so let's start with a trial range.

Reserving k=21G to 22G, n=25K to 100K.

[Siemelink]

As a tribute to this massive effort, I'll take a reservation too.

Reserving k=22G to 23G, n=25K to 100K.

Willem.
--
PS
40000093766*3^36414-1
40000132604*3^92956-1
40000249162*3^49500-1
40000263902*3^67723-1
40000612492*3^58970-1
40000802024*3^26071-1
40000857326*3^63562-1
40000857326*3^87319-1
40001001914*3^195180-1
40001016038*3^118209-1
40001123828*3^83824-1

[henryzz]

Approximately what percent of ks are primed between 25k and 100k?

[KEP]

Originally Posted by henryzz

Approximately what percent of ks are primed between 25k and 100k?

~71% (about 46% per double of n)