![]() |
With advancements in processors over time (he already upgraded to a dual core) I will go for
April 3, 2011 (my next prime number birthday) Which by the way will also be the same day that all first time and double check tests are done for all mersenne numbers under 10 million digits Which by the way will be when the 47th Mersenne prime will be found |
P.S. It is exactly one year since this thread started
|
M332,192,831
I have now converted the testing of M332,192,831 over to the new v25.5 of Prime 95 because I can use both cores of my Pentium D to test this number. My per iteration time is now 0.640 seconds, and I should finish no later than Summer 2014. However, I will obviously be getting newer, faster computers between now and then, so I am hoping to finish by 2010 or 2011. This test will be worth around 900 P-90 CPU years when it finishes, but unfortantely, since I am the only one testing, I will fall dramatically in the rankings between now and then. I am looking for as many new members as possible. Anyone is welcome!
|
One way to look at this is:
If you take your 900 years of work and assume it takes 3 more years to complete ... (I think I can fairly extrapolate on todays rate because while you will upgrade and get faster over time so will everyone else) ... you will be averaging about 74 P90 years each 90 days. Based on the current TPR top 500 producers report that puts your throughput on par with about the 200th Top Producer. But remember that he/she and everyone else will gain as well over the next 3 years some more, some less (excluding those who quit). Coincidentally from Feb 06 to Feb 07 the top 200 person did 305 P90 years of work ... extrapolating 3 years of works out to just over 900 P90 Years. Not sure this last math is relevant except to say you can't expect to get to top 200 with the current parameters. Let's try another track ... You are currently 1543 with 235 P90 years. All things being equal you will have 1,135 P90 years 3 years from now. From Feb 06 to Feb 07 the #500 person gained 155 P90 Years (extrapolate to 465 in 3 years). Today #500 has 616. Add to that 465 and you get 1081. I guess I will sum this up with a wild @$$ guess that 500th place is reasonable for you when your current 100M digit exponents completes in 3 years. |
M332,192,831 LL Testing
LL testing for M332,192,831 is well underway. I am using v25.5 of Prime95 and getting 1 iteration per 0.650 seconds, or roughly 130,000 iterations per day. I fully expect to reach 1,000,000 iterations late next Thursday night or early next Friday morning. I will post interim residues every 1,000,000 iterations on my website just as I did for M100,000,007, just in case anyone wants to doublecheck this. (WARNING: It will take nearly 10 years on a Pentium 4 processor, nearly 7 years on a Pentium D, or about 3-4 years on a Quad-Core Extreme Processor).
|
M332,192,831 Update
I have reached iteration 1,000,000! I am getting an average per iteration time of 0.6446 seconds, so I should complete one million iterations every 7.5 days or so. I updated [url]http://www.starqwest.org/page4.html[/url] with this and inserted a screenshot of Prime95 reaching this milestone. Note that I am using the NEW version 25.5 (currently a Beta version) so I can use both cores of my Pentium D on this test. The old v24.14 can only use one core and gets a per iteration time of 0.960 seconds.
|
How to register that large numbers to LL test?
Hello Starqwest. I am LL testing exponents in the range 50M-60M because I guess the next Mersenne prime will be in that range. But I don't know how to register such an exponent for Primenet. I always get an unknown error 3 in the client when it communicates with primenet and I even emailed George Woltman, but with no success until now. So I'd be glad if you could tell me how you managed to register that large numers. Since the current progress is shown on the status page I assume your client can communicate automatically after registration!? Thanks.
|
[QUOTE=multisync;118277]Hello Starqwest. I am LL testing exponents in the range 50M-60M because I guess the next Mersenne prime will be in that range. But I don't know how to register such an exponent for Primenet. I always get an unknown error 3 in the client when it communicates with primenet and I even emailed George Woltman, but with no success until now. So I'd be glad if you could tell me how you managed to register that large numers. Since the current progress is shown on the status page I assume your client can communicate automatically after registration!? Thanks.[/QUOTE]
I just put the line "Test=332192831,77,1" in the worktodo.ini file and it worked. Note that this line will trial factor 2^332192831-1 to 2^77 and do P-1 factoring before the LL test. If you just want to do a LL test, input the line "Test=332192831," or whatever exponent you want to test. I e-mailed George about this test and he put it into my account for testing, but you shouldn't need to do this for numbers less than 79,300,000. |
[QUOTE=StarQwest;118693]"Test=332192831,77,1" ... this line will trial factor 2^332192831-1 to 2^77 and do P-1 factoring before the LL test.[/QUOTE]This is not true : the second parameter tells Prime95 that trial factoring HAS ALREADY BEEN DONE to 2^77 and the third parameter that the P-1 factoring HAS ALREADY BEEN DONE. To achieve what you want the line should be Test=332192831,29,0. (The smallest number of the form 2*k*332192831+1 is 29,3 bits so anything below 30 will test that potential factor of M332192831. This is assuming there has been no previous trial factoring you can rely on...)
Jacob |
I think you're both right and wrong at the same time. I've noticed that version 24 and the beta version 25 do things a little differently. For instance, if you don't want to get work from the server, in version 24.14 you choose "Just Stress Testing," but in version 25.5 you say you're joining GIMPS, and then when it says "Get work from server(Y)" you say "N" and then you can do your own thing.
|
M332192831 Update
I am still running iterations on this number, but I am not running them 24/7 like I used to because it puts so much wear and tear on my machine. I try to run them whenever I have my computer on anyway, but it is incredibly slow going. I should hit 4 million iterations in a few days, but I won't hit 10 million until sometime in March. I'll try to keep posted more often, but trust me, this is going to take a loooooooooooooong time.:wink:
P.S. You can check my status on the status page of [url]www.mersenne.org[/url], but note that this test is at the very bottom and is represented by ********. |
| All times are UTC. The time now is 01:50. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.