![]() |
![]() |
#650 | |
Sep 2011
Germany
341310 Posts |
![]() Quote:
All bases with <100k left would be fine. You can also add all to the recommended list as now. I need a good balance with low, medium, long runs to keep up the available work. |
|
![]() |
![]() |
![]() |
#651 | |
"Gary"
May 2007
Overland Park, KS
13×907 Posts |
![]() Quote:
A bunch of 11k and 12k bases tested to n=100K are being sieved right now. I'll add them to the recommended as the sieve files become available. I feel like you have a good batch of reservations for medium and long tests right now especially with those long R2 tests on a big file. No real short tests though...unless you count n=100K as short tests. This begs the question: Would BOINC like any testing starting from n=25K or 50K in the future? That would require testing more than 400 k's. A way around that would be to break them up into pieces like we do with base 3 but in much smaller pieces. For instance for a base with 500 k's, we could send you 5 files in pieces of 100 k's each. I only mention this because the n=25K-100K testing that BOINC did several years ago seemed to be fairly popular because the bases were being reserved and finished fairly quickly. |
|
![]() |
![]() |
![]() |
#652 | |
Sep 2011
Germany
3,413 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#653 |
"Gary"
May 2007
Overland Park, KS
13·907 Posts |
![]() What do you mean by factors left? Do you mean k's remaining? If you mean k's remaining; all of our bases with < 400 k's remaining have already been tested to a limit of n=1e5. Then what I said in my previous post is correct. We could not be able to provide you with bases that have a test limit of n<1e5. In other words no short tests. Last fiddled with by gd_barnes on 2021-08-18 at 07:36 |
![]() |
![]() |
![]() |
#654 |
"Nuri, the dragon :P"
Jul 2016
Good old Germany
2×443 Posts |
![]()
I would be ready to make a few sieve files for n=10K-25K. I would go for:
R861 R448 R997 S763 S745 S448 Can you send me a file with there k´s remaining? Anyone can work on them as soon as the files are done, it should only take 1 week per file. For n=25K-100K (or 50K) i will wait til you got an agreement. |
![]() |
![]() |
![]() |
#655 | |
Quasi Admin Thing
May 2005
2·491 Posts |
![]() Quote:
A suggestion from here, is to maybe find in stead of a lower n that BOINC would be able to handle or desire to do, then maybe establish a minimum bit length? If n=100K for base 3 is the desired starting point, then we know that a minimum bit size per test of 158,496 bit is the desired starting point. Have a nice one. KEP |
|
![]() |
![]() |
![]() |
#656 | ||
"Gary"
May 2007
Overland Park, KS
13×907 Posts |
![]() Quote:
n=25K-50K (or 100K) was heavily tested by BOINC a few years ago. With all bases in that area having > 400 k's remaining I'd still like to hold off on doing much with it yet. They are frequently a much bigger effort than they look. Of course people are welcome to work on them on their own. Quote:
We will stick with only sending bases with <=100 k's remaining to BOINC. Last fiddled with by gd_barnes on 2021-08-18 at 20:27 |
||
![]() |
![]() |
![]() |
#657 |
"Nuri, the dragon :P"
Jul 2016
Good old Germany
2·443 Posts |
![]()
Sieve file for S685 attached.
Sieve file for S448 is attached, sieved up to p=150e9; factor every ~32 seconds. LLR test takes about 24 seconds for me (n=21K; 8 threads). |
![]() |
![]() |
![]() |
#658 |
"Nuri, the dragon :P"
Jul 2016
Good old Germany
2·443 Posts |
![]()
Sieve files for R295 and R997 can be found as attachments.
|
![]() |
![]() |
![]() |
#659 |
"Mark"
Apr 2003
Between here and the
2×72×71 Posts |
![]()
I had an idea. Could a column be added to http://www.noprimeleftbehind.net/cru...e-reserves.htm and the Riesel equivalent that indicates if the remaining k on the conjecture are "not sieved", "needs more sieving" and "sieving complete"? That column could then be used to feed a new column on the Unproven page. That column could be used by searchers to determine if one can go straight into testing or if they need to sieve first. And if you were to split the "Sieve files/general info" column into two columns, one linking the sieve file and one with the other info, then we could add a link to the sieve files directly to the Unproven page.
I don't know how many people would benefit from such additions, outside of me, but it would be nice. [Edit] As I think about it whether or not a conjecture is sieved deeply enough is dependent upon the program and hardware used for sieving. Maybe the sieve depth has more value as "sieving complete" is more subjective. The other two are less subjective. Last fiddled with by rogue on 2022-02-14 at 19:18 |
![]() |
![]() |
![]() |
#660 |
"Gary"
May 2007
Overland Park, KS
13×907 Posts |
![]()
My goal on sieving now is to have all of the currently posted sieve files for n>=100K fully sieved. As you found on your S1004 reservation some are under-sieved. There are 98 files that are under-sieved from Yoyo's perspective. 64 of them are for n<=1M.
I broke the 64 under-sieved files for n<=1M into 4 priorities. Priority #1 is for reserved and recommended bases. There are 7 bases in priority #1 and Yoyo is currently working on them. Mark, this includes your S1004. You can see the status of all Yoyo sieving here: https://www.rechenkraft.net/yoyo/y_status_sieve.php. Yoyo now has tremendous resources for sieving so this should only take a few months. Note that a high percentage of all posted sieve files for n>=100K are already fully sieved. If the sieve depth is P>=5e14 then the file is mostly likely fully sieved so you can tell by looking at their sieve depth. Once this is complete all posted files will be fully sieved unless otherwise noted as on huge n=2500-10K files. I'd rather not add any more detail to the pages. Once done the above effort will clean everything up. |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
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 | TimSorbet | Conjectures 'R Us | 1 | 2010-11-08 20:50 |