20210615, 07:55  #639 
Sep 2011
Germany
2·1,489 Posts 
S357 sieved to 10G
Results emailed 
20210807, 18:22  #641  
May 2007
Kansas; USA
2×5,261 Posts 
Quote:
If all bases with < 5000 k's remaining are done you can work your way up from there to < 6000 k's, < 7000 k's, etc. 

20210817, 14:55  #643 
"Nuri, the dragon :P"
Jul 2016
Good old Germany
1101000100_{2} Posts 
I have seen the discussion in the S3 thread, if we require new sieve files for n=25K100K i can sieve them up to P=1e12 before sending them to yoyo (if needed).
Takes a little time so i can start with checking S66 first; should be much faster with srsieve2 and multithreading now. Also: Would be n=10K25K also be well for BOINC, or are the runtimes to low / too much traffic? 
20210817, 15:48  #644  
"Mark"
Apr 2003
Between here and the
1100100011111_{2} Posts 
Quote:


20210817, 18:51  #645  
"Nuri, the dragon :P"
Jul 2016
Good old Germany
1101000100_{2} Posts 
Quote:
None of my servers have a GPU and my own is already getting quite old. However the speed is okayish: For ~7200 k´s i have a speed of 6K p/sec. Most bases on that range have a lot less, so the speed *should* be higher. For instance i could start with S270 and sieve it up to 1 factor every x minutes. 

20210817, 19:48  #646  
"Mark"
Apr 2003
Between here and the
59×109 Posts 
Quote:


20210817, 20:50  #647  
May 2007
Kansas; USA
2×5,261 Posts 
Quote:
Because base 3 is so prime we generally only sieve maxn/minn = 2. In this case n=25K50K. ~4050% of k's are eliminated with each doubling of the nrange. Reb has indicated that testing anything n<~90K for base 3 is a problem for BOINC due to the size of the files, the number of k's being tested, and the quickness of the tests. It will be up to individuals to get S3 tested to n=~100K. Even then if we turn part of it over to BOINC it will be need to be a few 1000k at a time...perhaps no more than a k=1G range. Reb also said that n=25K100K works for most bases as long as the files are not too big. BOINC did a lot of bases with 100400 k's remaining for n=25K100K a few years ago. A base like S66 would be too big for them. Also the tests for n=10K25K would be too fast. Last fiddled with by gd_barnes on 20210817 at 20:57 

20210817, 21:24  #648  
"Nuri, the dragon :P"
Jul 2016
Good old Germany
2^{2}·11·19 Posts 
Quote:
I am aware of that. Quote:
Splitting it up into 0,5G ranges would be a hassle, maybe its better to get tested by individuals. Quote:
What do you think is the maximum amount of k´s reb could handle; would splitting larger bases into smaller segments work; if its not too much work? I can do a few n=10K25K, but it will take a few months / weeks depending how many k´s are remain. 

20210817, 21:51  #649  
May 2007
Kansas; USA
2×5,261 Posts 
Quote:
I think n=10K25K would not work for BOINC for any base. It's just too inefficient to put them into most any server including individual PRPnet servers. There's quite a bit of overhead associated with sending each test out. Reb's servers do not automatically remove k's as primes are found. He has to remove them himself. This makes work on small n with lots of k's remaining inefficient and more labor intensive. I think this comes down to general project management and direction. I'm not fond of having BOINC work on small tests like this. They are much better suited for medium and huge tests...namely knocking bases down to 1, 2, or 3 k's remaining or proving them. :) Reb, can you weigh in on this again? Last fiddled with by gd_barnes on 20210817 at 22:06 

Thread Tools  
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  20141021 23:55 
Some CRUS stats  vmod  Conjectures 'R Us  213  20140228 21:23 
What are your CRUS plans?  rogue  Conjectures 'R Us  35  20131109 09:03 
CRUSlike sieving challenge  CRGreathouse  Puzzles  24  20111028 18:30 
how high will CRUS go  MiniGeek  Conjectures 'R Us  1  20101108 20:50 