mersenneforum.org Goals and Milestones
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2006-09-22, 20:01 #1 michaf     Jan 2005 479 Posts Goals and Milestones Some goals can be implemented in llr-net. Which ones do we want? As I suggested in another thread: * xxx tests needed to get all k tested upto n=2^17 * xxx tests needed to get all k tested upto n=2^18 * xxx tests needed to get all k tested upto n=2^19 etc... (How far do we need to go? Current sieve only goes to 2^21 so I think that should suffice for the next 20 years :> ) * xxx tests needed to get all k tested upto 1M digits? No idea how many digits we are on now... so some lower or higher limits might apply? * xxx candidates need to be cleared to get x Million remaining upto n=2M (Or even to 900k remaining, 800k etcetc... which values are most valuable? * Sieved upto 1T, 2T, 5T, 10T (Is this implementable in llr-net?) All for Riesel as well as Sierpinski of course :> Cheers, Micha
 2006-09-23, 11:16 #2 em99010pepe     Sep 2004 2·5·283 Posts My goal here is to be first in sieving so everyone ahead me please step aside! Carlos (Free-DC Mercenaries) Last fiddled with by em99010pepe on 2006-09-23 at 11:21
 2006-10-15, 18:45 #3 em99010pepe     Sep 2004 54168 Posts Almost there with only two sievers!!! Carlos
 2007-08-06, 23:22 #4 masser     Jul 2003 22·11·29 Posts Recent milestone I am not sure if anyone noticed, but with tnerual's recent prime we passed the following milestone: We now have less than 4 million first time tests to reach n=2,000,000, the current limit of our dat file. Now if we could only: 1. finish all first time tests up to n = 200,000. 2. sieve up to p=10^13 3. crack the top 1000 on the top 5000 list with our new Riesel primes...
 2008-02-07, 20:48 #5 masser     Jul 2003 100111111002 Posts On the Riesel Stats Page, you will notice that my recent sieving push has propelled me to 100000 Riesel factors found. Only michaf, Free-DC Mercenaries, geoff, rogue and axn1 have more Riesel factors... it will be a long time (if ever) until I catch axn1. You will also notice on that page that birdman2584 recently crossed 100000 Riesel first time tests. That's quite an achievement - I hope he continues to plug away and finds some primes. We still have not achieved goal #3 above, but I am confident we will in time. We have seen a good amount of testing on the Riesel queue lately, but we could sure use some more. Keep up the good work, folks.
 2008-02-07, 21:54 #6 michaf     Jan 2005 479 Posts That's a bit unfair comparison for you... we mostly got the easy factors in the start...
2008-06-05, 14:02   #7
masser

Jul 2003

127610 Posts

Quote:
 Originally Posted by masser I am not sure if anyone noticed, but with tnerual's recent prime we passed the following milestone: We now have less than 4 million first time tests to reach n=2,000,000, the current limit of our dat file. Now if we could only: 1. finish all first time tests up to n = 200,000. 2. sieve up to p=10^13 3. crack the top 1000 on the top 5000 list with our new Riesel primes...

We have finally finished goal #3 above. It only took 10 months, but any prime we find now (barring any primes doublechecking uncovers) will be in the top 1000 on the top 5000 list. Good work!

Two New Goals:

1. The dat file contains slightly more than 4 million candidates. It will not be long before we have less than 4 million candidates. So this goal has three parts...
a. Get the dat file down to less than 4 million candidates.
b. Get the Riesel component of the dat file down to less than 3 million candidates.
c. Get the Sierpinski component of the dat file down to less than 1 million candidates.

We are very close to completing part b (ltd can check this - it may already be completed). I think with my continued sieving surge, we can complete part a by the end of summer. Part c will probably require that we find a Sierpinski prime or two.

2. Reach 200,000 digits (n \approx 286000) on the Riesel and Sierpinski LLRNET queues. This is a lot of work, but with all of the manual testing currently on going, we can probably reach this goal by the end of the year.

2008-06-12, 16:04   #8
masser

Jul 2003

100111111002 Posts

Quote:
 Originally Posted by masser 1. The dat file contains slightly more than 4 million candidates. It will not be long before we have less than 4 million candidates. So this goal has three parts... a. Get the dat file down to less than 4 million candidates. b. Get the Riesel component of the dat file down to less than 3 million candidates. c. Get the Sierpinski component of the dat file down to less than 1 million candidates. We are very close to completing part b (ltd can check this - it may already be completed). I think with my continued sieving surge, we can complete part a by the end of summer. Part c will probably require that we find a Sierpinski prime or two.
With the two recent primes (found by MyDogBuster and robin_benson), we have completed parts (a) and (b) above. A new dat file reflecting this will be released soon. Part (c) will require A LOT of sieving or finding about two Sierpinski primes.

2008-07-25, 15:22   #9
masser

Jul 2003

22·11·29 Posts

Quote:
 Originally Posted by masser 2. Reach 200,000 digits (n \approx 286000) on the Riesel and Sierpinski LLRNET queues. This is a lot of work, but with all of the manual testing currently on going, we can probably reach this goal by the end of the year.
We have tested all Sierpinski candidates below 200,000 digits! Thanks to AMDave, robin_benson and vaughn for the recent surge in Sierpinski testing. I suspect we are very close to finding a Sierpinski prime.

 2008-08-05, 15:36 #10 AMDave     Jan 2006 deep in a while-loop 2×7×47 Posts I suspect this too. The question is who will get there first? signed, "Primeless and Desperate" Last fiddled with by masser on 2008-10-07 at 15:31
2008-10-07, 15:07   #11
masser

Jul 2003

22·11·29 Posts
Status of current goals

Quote:
 Originally Posted by masser Two New Goals: 1. The dat file contains slightly more than 4 million candidates. It will not be long before we have less than 4 million candidates. So this goal has three parts... a. Get the dat file down to less than 4 million candidates. b. Get the Riesel component of the dat file down to less than 3 million candidates. c. Get the Sierpinski component of the dat file down to less than 1 million candidates. We are very close to completing part b (ltd can check this - it may already be completed). I think with my continued sieving surge, we can complete part a by the end of summer. Part c will probably require that we find a Sierpinski prime or two. 2. Reach 200,000 digits (n \approx 286000) on the Riesel and Sierpinski LLRNET queues. This is a lot of work, but with all of the manual testing currently on going, we can probably reach this goal by the end of the year.

With rogue's recent Sierpinski prime, we have completed goal number 1: Less than 1 million Sierpinski candidates in the dat file, less than 3 million Riesel candidates and hence, less than 4 million total candidates.

The Riesel queue is currently at n=278000. An overestimate of the number of remaining Riesel tests up to 200,000 digits would be 12000. I will make some more Riesel manual reservation files available soon. We can probably complete goal number 2 by the end of the year.

KUTGW!

Last fiddled with by masser on 2008-10-07 at 15:08

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post pinhodecarlos NFS@Home 11 2018-03-21 03:06 mdettweiler No Prime Left Behind 3 2010-11-05 18:55 em99010pepe Octoproth Search 10 2007-01-28 12:34 Xyzzy Lone Mersenne Hunters 14 2003-08-13 23:02 TTn NFSNET Discussion 1 2003-06-18 17:59

All times are UTC. The time now is 15:57.

Mon Apr 6 15:57:19 UTC 2020 up 12 days, 13:30, 2 users, load averages: 1.32, 1.97, 2.00

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.