![]() |
[QUOTE=Minty;177381]Does the lucky winner get $3,000 soon, or does he have to wait until the 100 mill number comes up?![/QUOTE][LIST=1][*]Find 10Md MP, -(done)[*]GIMPS becomes GIMPS Inc., -(not done?)[*]Publish paper on 10Md MP, -(done)[*]Collect EFF 10Md prize money, -(not done)[*]Distro money to past finders., -(not done)[/LIST]Lather, rinse, repeat, save step 2.
|
[url]http://www.npr.org/templates/story/story.php?storyId=105344283[/url]
|
[QUOTE=Mini-Geek;177385][URL]http://www.mersenne.org/legal/#awards[/URL]
It's not 100% clear to me, but I'm pretty sure they have to wait until the 100M digit prime is found. I know that on v4 with the prize for a 10M digit prime, it was very clear that the prizes would only be given out after the 10M digit one was found. This one's not so clear, but I think that's still how it is...[/QUOTE] Well of course! GIMPS is not guaranteed to win the prize. Someone else could find one first. |
Navigating Primenet
[quote=Prime95;176012]It makes life fun - scouring the reports and using database queries to try and guess the exponent. I agree that hiding the fact that a potential prime has been found is not necessary.[/quote]
Not only fun, but an exercise to be encouraged! Assuming Lycorn's observation was available for all to see since April 12th, nobody seems to find the exercise trivial. I followed Kevin's directions, and when Tony asked for the exponent here. I promptly sent him it, and received two mails in return. Quotes: "THX. I should learn how Primenet works!" "Now someone has posted the exponent on the forum". This private tip off that the exponent was genuine made me feel obliged to keep the "secret" in the tradition of previously discovered primes which had been guessed by some. Hence my curt (and I hope humorous) response to Retina's disclosure. David |
[QUOTE=davieddy;177402]Not only fun, but an exercise to be encouraged!
Assuming Lycorn's observation was available for all to see since April 12th, nobody seems to find the exercise trivial. I followed Kevin's directions, and when Tony asked for the exponent here. I promptly sent him it, and received two mails in return. Quotes: "THX. I should learn how Primenet works!" "Now someone has posted the exponent on the forum". This private tip off that the exponent was genuine made me feel obliged to keep the "secret" in the tradition of previously discovered primes which had been guessed by some. Hence my curt (and I hope humorous) response to Retina's disclosure. David[/QUOTE]And I guess that makes me the first to "announce" the prime. Yay for me :) But this time around was not even the least bit exciting. So all you primenet folks, you failed bad. Hehe, hopefully that will encourage you all write some new crypty code to hide the next one, or possibly two, or more, MP(s) that might happen to pop-up in future. [size=1]Hint, just simply append the exponent to some secret text and hash it to make the faked residue. To easy![/size] |
Competition
[QUOTE=rgiltrap;177347]Congratulations Tony on reclaiming your verification crown.[/QUOTE]Thanks !
There are two good things with competition. First, if one competitor is not available, then another one can help and verify. Second, that pushes to make progress. I'm sure now that you and Ernst will very soon fix the problem you have with Mlucas. Maybe also (I hope so!) Guillermo will find time to go back to Glucas and adapt it to the new processors, probably with some help from me. Also, I'll spend some time studying the Nehalem and try to get the maximum performance with Glucas, prime95 and Mlucas. And remember that I pushed George a lot to make prime95 multi-threaded. Competition leads to improvements. Science leads to progress. But mainly George, Guillermo and Ernst do deserve congratulations, because they spent so many thousand hours working on their baby... Now, I've been said that prime95 is required by some HPC customers to be run as a torture test on processors, because it is known to be a very efficient toaster !! Now, I would like some Mathematician to look at the conjectures Anton Vrba and I did about Cycle-LLT for Mersenne, Wagstaff and Fermat numbers... I'm sure that, one day, there will be more known Wagstaff primes than known Mersenne primes.. when the conjecture moves to a theorem, for sure. Tony |
[quote=retina;177403]And I guess that makes me the first to "announce" the prime. Yay for me :)
[/quote] As Flatlander noticed, you convinced Curt Noll: [URL]http://isthe.com/chongo/tech/math/prime/mersenne.html[/URL] |
Other verifications
There are still 3 other verifications being done:
- Rob+Tom+Ernst : Mlucas on Sun - Jeff : Glucas on Itanium2 - My second verification : Glucas on Itanium2. It is not really a different verification than the other one I did, since I used some Interim file from this one to continue the verification on Nehalem. However, I have a mail robot sending every hour residues to the other verifiers, in order to help them to check that no problem occured, like for Kevin. Should end tomorrow around 1:45 am CST time, if I remember well. - Kevin's verification : prime95 Quad Intel : stopped. An error appeared in some residues. George has not yet found any hint about why. Sun's guys talked about the main difference between a PC and a "strong" machine, like SPARC, POWER, Itanium2 machines: the big ones do incorporate many mechanisms for verifying data and silently fix hardware errors. Now, we are interested in knowing when the 3 other verifications will end. Though they are not required for the announcement, it is very interesting to know if they can do a whole verification in complex multi-threaded environment without any error. George said that, for a 100M prime, 2 verifications are required ! Tony |
Glucas / Itanium2 16x
[QUOTE][Jun 13 08:42:47] Iter. 38000000 ( 89.11%), Err= 0.000, 36740.46 user 20997% CPU (0.0175 sec/iter).
[Jun 13 08:42:47] M42643801. Saved Interim file at iteration 38000000. Res64: 29719C76883E5781.[/QUOTE]90.45% done at 11:30am France (4:30am CST) Tony |
[QUOTE=T.Rex;177412]90.45% done at 11:30am France (4:30am CST)
Tony[/QUOTE] I'm 71% done (10pm NZT) with Mlucas / Sparc / Solaris and can confirm matching residues with Tony's run at 30 Million Iterations. M42643801 Iter# = 30000000 [0.0182 sec/iter] Res64: 199486E4C9B5ED22. Alas, I come second to France again this evening with the French rugby team beating the All Blacks :cry: Fortunately finding Mersenne primes is a more frequent event the losing rugby matches to France. :smile: Rob. |
[quote=cmd;177413]( remember to update the meter visits in mersenneforum.org)[/quote]
But M43112609 is still the largest known Mersenne. |
| All times are UTC. The time now is 21:48. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.