mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Prime Sierpinski Project

Reply
 
Thread Tools
Old 2008-06-26, 13:45   #1
hhh
 
hhh's Avatar
 
Jun 2005

373 Posts
Exclamation Sievulator

Dear friends, please have a look at the little spreadsheed I attached, together with a manual.
Quickstarting guide:

In the sheed:
Grey fields are for you to fill out (they are prefilled, but you can change these)
All the rest, don't touch it.
Yellow is giving you the results.

If you want to put in your timings, proceed as follows: Run an LLR test, note its n and the time it took. Put those two in.

Start a range with sr2sieve (no need to finish it), and note the expected remaining time in hours and how many factors are expected.

In the percentage field, you can paste your estimate of what percentage of the factors is going to be actually used.

If you would like to share your results, please post the stuff in the grey and yellow boxes only.

(Template)
PSP/SoB
[Your computer type]
N:xxxxxxxx
Time for that N:xxx h

Sieve range start: xxxxxxxx G
Time for that range: xxx h
Expected factors: xx,x

Result: strongly sieving!!! (Won't change, I promise)

Have fun, H.
Attached Files
File Type: zip sievulator.zip (67.7 KB, 172 views)

Last fiddled with by hhh on 2008-06-29 at 09:30
hhh is offline   Reply With Quote
Old 2008-06-26, 23:42   #2
VJS
 
VJS's Avatar
 
Dec 2004

13·23 Posts
Question

hhh,

Why don't you use the following n's

firstpass 5M
secondpass 1.8M

80% n's found before 50M
use a core quad for the analysis I'm sure someone has some times.

Use that for the starting template...

I'm sure I did something wrong b/c when I worked the numbers it looked like we should do more llr
VJS is offline   Reply With Quote
Old 2008-06-27, 08:16   #3
hhh
 
hhh's Avatar
 
Jun 2005

373 Posts
Default

Did you use the Riesel Template or the PSP template? Riesel is the upper one.

Which n is used for timing shouldn't change much. Yet, honestly, I dont quite get your question, I have to admit.

H.
hhh is offline   Reply With Quote
Old 2008-06-28, 13:04   #4
VJS
 
VJS's Avatar
 
Dec 2004

13×23 Posts
Default

Humm,

Yup I did use the RS template, didn't think it would make much difference.

I guess my only problem with the template is the basis of the hours for LLR testing. I guess its a garbage in garbage out sort of thing but your template shows that a factor is worth 100 times it's weight in LLR testing depending on what you put in. I'd have to give it a little more thought.
VJS is offline   Reply With Quote
Old 2008-06-28, 21:04   #5
hhh
 
hhh's Avatar
 
Jun 2005

1011101012 Posts
Default

Quote:
Originally Posted by VJS View Post
... that a factor is worth 100 times it's weight in LLR testing depending on what you put in.
I'm not quite sure about what you mean by "depending on what you put in", but I think that's kind of the point. A factor might be for n=5000000 and be worth a couple of hours on a fast pc, or for n=45000000 and be worth a couple of months. The chances of both events are the same, so a factor is roughly speaking worth at least a month, so until we wait a month for a factor, sieving is worth it.

OK, I have to admit that with riesel sieve, they approach the optimal sieve depth. If they sieve twice as deep or so, they are done; and sieving further will only save 1/50 of the tests or so; but yet, more effectively.

Timings? Anyone? I will upload a spreadsheet with the results for different machines as soon as I get the numbers.

H.
hhh is offline   Reply With Quote
Old 2008-06-29, 03:41   #6
Sloth
 
Sloth's Avatar
 
Mar 2006

2·47 Posts
Default

Have numbers off a couple machines

PSP/SoB
P4 2.4GHz - socket 478 but not sure bus speed
N:5402590
Time for that N:45.42 h

Sieve range start: 10000000 G
Time for that range: 54 h
Expected factors: .53


PSP/SoB
C2D E4500 @ 2.2GHz
N:5053493
Time for that N:22.0 h

Sieve range start: 10000000 G
Time for that range: 29 h
Expected factors: .53
Sloth is offline   Reply With Quote
Old 2008-06-29, 09:33   #7
hhh
 
hhh's Avatar
 
Jun 2005

5658 Posts
Default

Thanks. I just made a new one, with even more conservative hypotheses: 80% of the factors go out of the window, and so on. Sieving is still an order of magnitude better than LLR.

Cheers, H.
hhh is offline   Reply With Quote
Old 2008-06-29, 16:52   #8
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

624910 Posts
Default

Quote:
Originally Posted by hhh View Post
Thanks. I just made a new one, with even more conservative hypotheses: 80% of the factors go out of the window, and so on. Sieving is still an order of magnitude better than LLR.

Cheers, H.
What exactly do you mean by "80% of the factors go out of the window"? Do you mean those are found for lower n's that have already been passed in terms of LLR? (If that's what you mean, then, why not simply remove everything from the dat file that's been already LLR tested--I'm sure you'd get a big speed boost! I know that removing individual numbers from the dat doesn't do much, but shrinking the range--now that's a different story. )

Last fiddled with by mdettweiler on 2008-06-29 at 16:53
mdettweiler is offline   Reply With Quote
Old 2008-06-29, 18:51   #9
hhh
 
hhh's Avatar
 
Jun 2005

17516 Posts
Default

Quote:
Originally Posted by Anonymous View Post
What exactly do you mean by "80% of the factors go out of the window"? Do you mean those are found for lower n's that have already been passed in terms of LLR?
No. Those are not taken into account anyway. What I mean is that we are all the time finding factors for high n; Yet, those will probably never save an LLR test, because a prime for their k and a lower n is found, hence stopping all LLR-testing. 80% means that only 2 or 3 k resist to yield a prime until 50M.

H.
hhh is offline   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 05:35.

Fri Apr 23 05:35:14 UTC 2021 up 15 days, 16 mins, 0 users, load averages: 1.97, 1.67, 1.62

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.