![]() |
|
|
#551 |
|
Dec 2011
After milion nines:)
23×181 Posts |
R463and S463 are sieved right now: from 10000 WU , 1364 workunits is done, finding over 13000 factors.
S 896 will be processed after S/R 463 is over |
|
|
|
|
|
#552 |
|
Dec 2011
After milion nines:)
144810 Posts |
It was not S896 ( it is proven) so I was little confused
S892 is over, sent to Gary via mail |
|
|
|
|
|
#553 |
|
May 2007
Kansas; USA
101×103 Posts |
|
|
|
|
|
|
#554 |
|
May 2007
Kansas; USA
101×103 Posts |
Pepi,
For a base with 2 k's remaining, what sieve depth would Yoyo need as a starting point for sieving n=200K to 1M ? I will likely do a large amount of this initial sieving for such bases and then forward them on to you for sending to Yoyo. Thanks, Gary |
|
|
|
|
|
#555 | |
|
Dec 2011
After milion nines:)
23·181 Posts |
Quote:
Gary you dont need to do initial sieving: I wrote small script that do most of job: so it is pretty automated thing. So I will put focus on 2 K bases, R - S side and send to YOYO. Maybe important question is "optimal" sieve depth: if those sequences will be processed with REB , then lower sieve depth is not problem: but "average " user can get benefit from deeper sieving. It is huge "distance" in candidate that have 200K as exponent and 1M as exponent :) |
|
|
|
|
|
|
#556 | |
|
May 2007
Kansas; USA
101×103 Posts |
Quote:
OK great. The focus would be on 2 k bases that are presently only tested to n=200K or 250K. If you think that n=200K-1M is too much sieve range, you can choose n=200K-500K instead. My thinking in choosing n=200K-1M is that if a prime is found, the base would be 1 k...and it is preferable to have 1 k bases sieved up to n=1M. |
|
|
|
|
|
|
#557 | |
|
Dec 2011
After milion nines:)
144810 Posts |
Quote:
So be it: from now on focus in on two K bases (200-250k ) at start. I also share you idea to sieve up to 1M but then I will set sieve depth to 5e14. That sieve depth is ok as far for BOINC as for individuals |
|
|
|
|
|
|
#558 | |
|
"Nuri, the dragon :P"
Jul 2016
Good old Germany
811 Posts |
Quote:
I´d like to add some other suggestion here. Focus on the bases with the lowest "difficulty" as shown in the unproven table. I will focus my work on those with less than 20K from now on. Edit: BTW, how is this value calculated anyway? Last fiddled with by MisterBitcoin on 2019-09-30 at 20:22 |
|
|
|
|
|
|
#559 | |
|
May 2007
Kansas; USA
101×103 Posts |
Quote:
![]() Mark came up with the formula. It may be something like the candidates remaining on a sieve to P=1T multiplied by the log of (the base multiplied by search depth squared) and then all divided by some fixed amount to make it reasonable. It effectively gives an exact mathematical difficulty of how long it would take to increase the testing of a base by some small n amount. If you double the test depth you 4x the difficulty (if no primes found). Last fiddled with by gd_barnes on 2019-10-01 at 00:57 |
|
|
|
|
|
|
#560 |
|
"Mark"
Apr 2003
Between here and the
18D016 Posts |
|
|
|
|
|
|
#561 |
|
May 2007
Kansas; USA
101·103 Posts |
https://www.rechenkraft.net/yoyo/y_status_sieve.php It looks like there is 1 work unit left as of this posting. So it will be done anytime now. Pepi, can you send this file containing both bases to me soon after it is complete? I will reserve R463 and Mark will reserve S463. Thanks. Last fiddled with by gd_barnes on 2019-10-10 at 20:08 |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Sieving Drive all base 2/4 k's worked by CRUS | gd_barnes | Conjectures 'R Us | 143 | 2014-10-21 23:55 |
| Some CRUS stats | vmod | Conjectures 'R Us | 213 | 2014-02-28 21:23 |
| What are your CRUS plans? | rogue | Conjectures 'R Us | 35 | 2013-11-09 09:03 |
| CRUS-like sieving challenge | CRGreathouse | Puzzles | 24 | 2011-10-28 18:30 |
| how high will CRUS go | Mini-Geek | Conjectures 'R Us | 1 | 2010-11-08 20:50 |