mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Operation Billion Digits

Reply
 
Thread Tools
Old 2005-01-29, 22:50   #56
Jwb52z
 
Jwb52z's Avatar
 
Sep 2002

32216 Posts
Default

When will the webpage be updated with the new info and the next level, if any?
Jwb52z is offline   Reply With Quote
Old 2005-01-30, 06:21   #57
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

26·37 Posts
Default

Quote:
Originally Posted by Jwb52z
When will the webpage be updated with the new info and the next level, if any?

I wrote up the status changes before I posted the congratulations, but I forgot to move the page to the external web site. Now visible at

http://ElevenSmooth.com/Billion.html

Work's been in crises mode for a while - I'm not sure if I'll get the new exponents out this weekend.
wblipp is offline   Reply With Quote
Old 2005-01-30, 06:29   #58
Jwb52z
 
Jwb52z's Avatar
 
Sep 2002

14428 Posts
Default

I have just one more question, if you don't mind. How many bits do numbers this large have to be factored to ultimately before we can be sure they are sufficiently proven not to be candidates any longer? I know have asked questions like this before, but I'm really stupid with math beyond very basic things.
Jwb52z is offline   Reply With Quote
Old 2005-01-30, 07:01   #59
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

94016 Posts
Default

I'm sorry. We should probably repeat this more often.

Operation Billion Digitis is a bit of a joke - a lark - a whimsy

There is no hope of proving any of the numbers prime. GIMPS now tests test numbers of roughly 10 million digits in a month. Test time grows faster than the square of the number of digits. These numbers have a hundred times the digits, so it would take over 10,000 months to prove one prime with today's computers. If Moore's law continues to double computer power every 18 months, we would still need over fifteen years to get the test time to under one year.

This joke is organized like the first stage of a legitimate search. The first stage uses trial factoring. That first stage is feasible on today's computers. But the next stages would use P-1, P+1, and ECM factoring - these stages are not feasible for numbers this large, so the joke is stuck in perpetual step 1.

Personally, I keep a P-Pro 180 cranking away on this because it amuses me. It's actually one side of a dual processor machine that serves as my firewall and print server. The other side participates in ElevenSmooth and it's coming replacement project, but I prefer the less memory intensive activity for the second processor.

Join in if you find this quirky activity appealing. But don't image that this is seriious.
wblipp is offline   Reply With Quote
Old 2005-01-30, 17:19   #60
Jwb52z
 
Jwb52z's Avatar
 
Sep 2002

11001000102 Posts
Default

I read the message on the webpage that it wouldn't be possible to do it with today's technology to totally prove them prime or not, but I never imagined it was a joke. I've seen people start projects to just get ahead of the game as much as they could, but those never lasted very long. I figured it was the same here.

Last fiddled with by Jwb52z on 2005-01-30 at 17:20
Jwb52z is offline   Reply With Quote
Old 2005-01-31, 03:16   #61
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

7·1,427 Posts
Default

Quote:
Originally Posted by Jwb52z
I read the message on the webpage that it wouldn't be possible to do it with today's technology to totally prove them prime or not,
If we do find a factor, we have for about half the numbers that we have worked on, we know that it is not prime. Thus with each factor found we have saved ~10,000 Pentium4 3.2GHz months.
Uncwilly is online now   Reply With Quote
Old 2005-01-31, 20:34   #62
Jwb52z
 
Jwb52z's Avatar
 
Sep 2002

2×401 Posts
Default

Uncwilly, even though the project is "just for fun" so to speak, I would call saving that much time worthwhile :)
Jwb52z is offline   Reply With Quote
Old 2005-02-01, 20:48   #63
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

3×1,609 Posts
Default

Quote:
Originally Posted by hemster
Finally a factor: M3321931037 has a factor of 1968130744509288556121
Finished up to 2^71

and M3321931043 has no factor up to 2^71
I will work on the other two up to 2^71 before I go on with this one.
Did you inform Will Edgington, or do you want that I will send him an email about your discover?

Luigi
ET_ is offline   Reply With Quote
Old 2005-02-08, 18:17   #64
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

3·1,609 Posts
Default

M3321931429 no factor from 2^64 to 2^72.

Carlo (& Luigi)
ET_ is offline   Reply With Quote
Old 2005-02-11, 21:22   #65
hemster
 
Apr 2004
PDX

2·32 Posts
Default

Luigi,
I have not informed him. Didn't know it was big enough to worry about...
Could you do that?

Thanks
Mark
hemster is offline   Reply With Quote
Old 2005-02-11, 23:35   #66
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

3·1,609 Posts
Default

Quote:
Originally Posted by hemster
Luigi,
I have not informed him. Didn't know it was big enough to worry about...
Could you do that?

Thanks
Mark
Sure I will!

Luigi
ET_ is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
What does * represent on Recent Results report? petrw1 PrimeNet 5 2018-07-09 21:14
Report for PRP houding PrimeNet 15 2018-01-10 19:24
How to report GPU results dcorbit Information & Answers 4 2012-08-13 21:53
How to report P-1 results James Heinrich Marin's Mersenne-aries 6 2004-05-27 05:47
Bug report remaker Software 4 2002-10-17 08:18

All times are UTC. The time now is 19:26.


Fri Oct 15 19:26:44 UTC 2021 up 84 days, 13:55, 0 users, load averages: 2.14, 2.02, 1.91

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