mersenneforum.org Sieving for CRUS
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

2015-12-13, 05:52   #12
VBCurtis

"Curtis"
Feb 2005
Riverside, CA

27×3×13 Posts

Quote:
 Originally Posted by LaurV S428 200k
The k's remaining are low-weight enough that it's pretty likely the entire file will be tested; so this question is roughly equivalent to "what sieve depth minimizes the time to sieve plus the time to LLR the file?" In the short run, it's about finding the point where breaking off a piece (say, 200-300k) for LLR followed by more sieving on 300k-1M is better than just sieving more on the 200k-1M file.

If you test the 300k-1M sieve speed vs 200k-1M, you'll find that there's very little speed gain, meaning the 200-300 piece is, in a sense, getting sieved for free since we'll want the rest of the file sieved more. The heuristic I've found is that sieving until the sec/factor is at least double the LLR time for the smallest candidate is at the lower end of the right time to break off a piece.

However, you won't be LLRing it yourself- BOINC will. Just like the NFS@home matrix-solvers have NFS@ home make extra relations to make their matrix task shorter, there's nothing wrong with sieving less for BOINC than you might for yourself. For Riesel-3, I've been sending pieces of the sieve files to rebirther when sec/factor in sieve is the same as sec/test in LLR for a typical candidate in the piece.

30e12 would be a good spot to aim for for BOINC work, 50-75e12 for your own work.

2015-12-13, 11:37   #13
LaurV
Romulan Interpreter

Jun 2011
Thailand

24×13×47 Posts

Quote:
 Originally Posted by VBCurtis If you test the 300k-1M sieve speed vs 200k-1M, you'll find that there's very little speed gain, meaning the 200-300 piece is, in a sense, getting sieved for free since we'll want the rest of the file sieved more.
Thanks for the reply, I found that, or something similar. I got the idea that I need to sieve to 3e13, that is what I need to know. In a sense, as you said, if some prime divides some s(n), the n is "random", so its chance to be in 300k-1M is 7/8 from the chance that n is in 200k-1M, and this is what the factor list shows: about one in 8 is in 200k-300k, and i get one every ~125 seconds, i.e. about 1000 seconds per factor.

2015-12-13, 21:50   #14
Puzzle-Peter

Jun 2009

68610 Posts

Quote:
 Originally Posted by rebirther Hi Fellowers, if someone is able to sieve some S/R Bases from 25-100k this would be great. Also 100-200k and 200-400k are welcome. Iam out of running these ranges soon in BOINC and I dont want to loose time. Thx in advance!
Do you also need some XXL tests? I could give you a ready-to-go sieve file for S/R22 n=1.5M - 2M.

2015-12-14, 05:57   #15
rebirther

Sep 2011
Germany

2×1,489 Posts

Quote:
 Originally Posted by Puzzle-Peter Do you also need some XXL tests? I could give you a ready-to-go sieve file for S/R22 n=1.5M - 2M.
No, the main target is 25-100k

2015-12-15, 19:57   #16
wombatman
I moo ablest echo power!

May 2013

23×223 Posts
R347

Here's the sieved file (P=20e12) for R347 from n=200k-400k. There are 1679 candidates remaining.

Edit: I can go ahead and run base 373 as well. Is there an easy to run both the S373 and R373 at the same time? Or do I just run them concurrently with two instances of the siever?

Nevermind, got it sorted.
Attached Files
 r347_20e12.zip (4.2 KB, 238 views)

Last fiddled with by wombatman on 2015-12-15 at 20:21

 2015-12-16, 01:40 #17 LaurV Romulan Interpreter     Jun 2011 Thailand 100110001100002 Posts S428 status report: reached 12T, continuing to 30T as per Curtis' advice. In the same time I let cllr running for S428(8), it reached n=120k (this is a DC, but I don't think I will go to the full n=200k, as it is already getting very slow).
 2015-12-21, 23:28 #18 wombatman I moo ablest echo power!     May 2013 23×223 Posts S/R373 and R610 R/S373 (k=18 and k=108, respectively) is on its way to P=20e12 and should finish Christmas Day. R610 is heading to P=15e12, finishing on the 23rd.
 2015-12-22, 00:41 #19 gd_barnes     May 2007 Kansas; USA 23·5·263 Posts Later tonight, I'll include a list of what is being worked on and who has what reserved for BOINC sieving in the first posting here. I'll also put a link to all completed files on the pages. Ian just sent me a large batch of bases sieved for n=25K-100K. That should keep BOINC busy for a while. :-)
 2015-12-22, 04:00 #20 wombatman I moo ablest echo power!     May 2013 23·223 Posts Sweet! Thanks!
2015-12-23, 16:57   #21
wombatman
I moo ablest echo power!

May 2013

23×223 Posts
R610

Here's R610 for n=200k-400k, taken to P=15e12. 2284 candidates remaining.
Attached Files
 r610_15e12.zip (6.1 KB, 313 views)

Last fiddled with by wombatman on 2015-12-23 at 16:57

 2015-12-25, 06:11 #22 gd_barnes     May 2007 Kansas; USA 101001000110002 Posts I received a large batch of sieve files from Ian for n=25K-100K and 100K=200K. There is now a link to all of them on the pages. They are as follows: Code: R91 100K-200K R166 25K-100K R291 25K-100K R313 25K-100K R403 25K-100K R418 25K-100K R421 25K-100K R490 25K-100K R510 100K-200K R553 25K-100K R565 25K-100K R602 100K-200K R694 100K-200K R696 100K-200K R783 100K-200K R803 100K-200K R823 25K-100K S91 100K-200K S166 25K-100K S243 25K-100K S421 25K-100K S490 25K-100K S591 25K-100K S820 25K-100K S821 100K-200K S823 25K-100K S832 100K-200K S931 25K-100K

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post gd_barnes Conjectures 'R Us 143 2014-10-21 23:55 vmod Conjectures 'R Us 213 2014-02-28 21:23 rogue Conjectures 'R Us 35 2013-11-09 09:03 CRGreathouse Puzzles 24 2011-10-28 18:30 Mini-Geek Conjectures 'R Us 1 2010-11-08 20:50

All times are UTC. The time now is 07:29.

Mon Oct 18 07:29:24 UTC 2021 up 87 days, 1:58, 0 users, load averages: 1.38, 1.18, 1.15

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.