mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > PrimeNet

Reply
 
Thread Tools
Old 2008-09-16, 15:56   #1
petrw1
1976 Toyota Corona years forever!
 
petrw1's Avatar
 
"Wayne"
Nov 2006
Saskatchewan, Canada

121668 Posts
Default Is it time for a 100M digit option?

In the same way that Prime95 currently allows us to:
"Choose 10,000,000 digit numbers to test"

Does there now need to be an option to:
"Choose 100,000,000 digit numbers to test"

Sure it will take a LONG time but then my first 10M test 6 years ago took 15 months on my PIII-400. Would the 100M tests take any longer than that on current hardware?

OR as Mr. Silverman suggested in post #710 of the "BATMAN" thread, is it time to fill in the gaps?
petrw1 is offline   Reply With Quote
Old 2008-09-16, 16:03   #2
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

11·389 Posts
Default

Prime95v25/PrimeNetv5 allow you to choose to search 100M digit candidates only. I think the default will still be to search the smallest first-time that are available (assuming a fast computer), i.e. filling in the gaps.
Mini-Geek is offline   Reply With Quote
Old 2008-09-16, 16:18   #3
petrw1
1976 Toyota Corona years forever!
 
petrw1's Avatar
 
"Wayne"
Nov 2006
Saskatchewan, Canada

523810 Posts
Default

My bad for not checking there first....
petrw1 is offline   Reply With Quote
Old 2008-09-16, 17:27   #4
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101ร—103 Posts

2×5×13×83 Posts
Default

I was hoping for a 100M TF option. BTW, how far would make sense and the settings for P-1 (or ECM)?
Uncwilly is offline   Reply With Quote
Old 2008-09-17, 01:21   #5
jinydu
 
jinydu's Avatar
 
Dec 2003
Hopefully Near M48

110110111102 Posts
Default

Quote:
Originally Posted by petrw1 View Post
Sure it will take a LONG time but then my first 10M test 6 years ago took 15 months on my PIII-400. Would the 100M tests take any longer than that on current hardware?
I think so. My test of M100,000,039 on one core of a desktop with Core 2 Duo E6700 will take over a year. Assuming that the amount of work required to complete a test is proportional to FFT size and proportional to the number of iterations, a test of M332,192,831 (the first Mersenne number above 100 million digits) would require over 11 times as much work. I think such a test would take at least 4 years on current hardware.
jinydu is offline   Reply With Quote
Old 2008-09-17, 04:41   #6
Syd
 
Syd's Avatar
 
Sep 2008
Krefeld, Germany

2×5×23 Posts
Default

Quote:
Originally Posted by jinydu View Post
I think so. My test of M100,000,039 on one core of a desktop with Core 2 Duo E6700 will take over a year. Assuming that the amount of work required to complete a test is proportional to FFT size and proportional to the number of iterations, a test of M332,192,831 (the first Mersenne number above 100 million digits) would require over 11 times as much work. I think such a test would take at least 4 years on current hardware.
I tried M332192831 on my Q6700, with
1 Thread: 0.586 sec. per Iteration = about 6 years
2 Threads: 0.318 sec. per Iteration = 3 Years, 4 Months
3 Threads: 0.258 sec. per Iteration = 2 Years, 8 Months
4 Threads: 0.202 sec. per Iteration = 2 Years, 1 Month.
Syd is offline   Reply With Quote
Old 2008-09-17, 05:05   #7
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

97×103 Posts
Default

Your memory chips are apparently good/fast. This is rather good scaling.
Would one expect to have no errors for 2 years on 4 cores? That is the question to ponder before embarking.

That reminds me to look for the origins of a citation that I long remembered but now completely unsure. From some sci-fi novel... It goes like this - "Should we depart for Alpha Centauri next year and arrive there in 50,000 years, or should we wait for another 50 years and then get there in 25,000 years?" (don't nitpick about the exact numbers, though, ok?)

--Serge
Batalov is offline   Reply With Quote
Old 2008-09-17, 08:48   #8
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

24·3·101 Posts
Default

Quote:
Originally Posted by Batalov View Post
Your memory chips are apparently good/fast. This is rather good scaling.
Would one expect to have no errors for 2 years on 4 cores? That is the question to ponder before embarking.

That reminds me to look for the origins of a citation that I long remembered but now completely unsure. From some sci-fi novel... It goes like this - "Should we depart for Alpha Centauri next year and arrive there in 50,000 years, or should we wait for another 50 years and then get there in 25,000 years?" (don't nitpick about the exact numbers, though, ok?)

--Serge
Sagan's "Contact", maybe?

Luigi
ET_ is offline   Reply With Quote
Old 2008-09-17, 08:54   #9
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

2·34·41 Posts
Default

Quote:
Originally Posted by Batalov View Post
Your memory chips are apparently good/fast. This is rather good scaling.
Would one expect to have no errors for 2 years on 4 cores? That is the question to ponder before embarking.

That reminds me to look for the origins of a citation that I long remembered but now completely unsure. From some sci-fi novel... It goes like this - "Should we depart for Alpha Centauri next year and arrive there in 50,000 years, or should we wait for another 50 years and then get there in 25,000 years?" (don't nitpick about the exact numbers, though, ok?)

--Serge
I don't see this as the same thing. For the number testing we can transfer the current state of the test to a new machine and continue at a faster rate. But in contrast, for the Alpha Centauri trip the transfer of work to the new ship does not apply. So any number testing should be started now and any trips to Alpha Centauri should be started only when the expected time of arrival is at a minimum.
retina is offline   Reply With Quote
Old 2008-09-17, 09:18   #10
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

2D4216 Posts
Default

Quote:
Originally Posted by retina View Post
I don't see this as the same thing. For the number testing we can transfer the current state of the test to a new machine and continue at a faster rate. But in contrast, for the Alpha Centauri trip the transfer of work to the new ship does not apply. So any number testing should be started now and any trips to Alpha Centauri should be started only when the expected time of arrival is at a minimum.
I don't see any reason why, in principle, the faster ship should not be launched with sufficient spare capacity to pick up the occupants of the slower as it goes by.

Might not be economically viable though.

Paul
xilman is offline   Reply With Quote
Old 2008-09-17, 09:22   #11
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

2·34·41 Posts
Default

Quote:
Originally Posted by xilman View Post
I don't see any reason why, in principle, the faster ship should not be launched with sufficient spare capacity to pick up the occupants of the slower as it goes by.
Sure, but then what was the point of the first group leaving so early? they might as will hang around partying and then jump on the second ship when it leaves.
retina is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
CPU time for 100M digit prime test biggerben Software 7 2014-10-24 05:47
I want a 100M digit Mersenne that.... JuanTutors PrimeNet 8 2012-12-06 13:47
How far along are you in your 100M digit LL test? JuanTutors Lounge 6 2012-02-21 07:36
100M-digit n/k pairs __HRB__ Riesel Prime Search 0 2010-05-22 01:17
100M digit prime Unregistered Information & Answers 10 2010-03-24 20:16

All times are UTC. The time now is 21:05.


Thu Dec 8 21:05:15 UTC 2022 up 112 days, 18:33, 0 users, load averages: 1.02, 1.11, 1.14

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

โ‰  ยฑ โˆ“ รท ร— ยท โˆ’ โˆš โ€ฐ โŠ— โŠ• โŠ– โŠ˜ โŠ™ โ‰ค โ‰ฅ โ‰ฆ โ‰ง โ‰จ โ‰ฉ โ‰บ โ‰ป โ‰ผ โ‰ฝ โŠ โŠ โŠ‘ โŠ’ ยฒ ยณ ยฐ
โˆ  โˆŸ ยฐ โ‰… ~ โ€– โŸ‚ โซ›
โ‰ก โ‰œ โ‰ˆ โˆ โˆž โ‰ช โ‰ซ โŒŠโŒ‹ โŒˆโŒ‰ โˆ˜ โˆ โˆ โˆ‘ โˆง โˆจ โˆฉ โˆช โจ€ โŠ• โŠ— ๐–• ๐–– ๐–— โŠฒ โŠณ
โˆ… โˆ– โˆ โ†ฆ โ†ฃ โˆฉ โˆช โŠ† โŠ‚ โŠ„ โŠŠ โŠ‡ โŠƒ โŠ… โŠ‹ โŠ– โˆˆ โˆ‰ โˆ‹ โˆŒ โ„• โ„ค โ„š โ„ โ„‚ โ„ต โ„ถ โ„ท โ„ธ ๐“Ÿ
ยฌ โˆจ โˆง โŠ• โ†’ โ† โ‡’ โ‡ โ‡” โˆ€ โˆƒ โˆ„ โˆด โˆต โŠค โŠฅ โŠข โŠจ โซค โŠฃ โ€ฆ โ‹ฏ โ‹ฎ โ‹ฐ โ‹ฑ
โˆซ โˆฌ โˆญ โˆฎ โˆฏ โˆฐ โˆ‡ โˆ† ฮด โˆ‚ โ„ฑ โ„’ โ„“
๐›ข๐›ผ ๐›ฃ๐›ฝ ๐›ค๐›พ ๐›ฅ๐›ฟ ๐›ฆ๐œ€๐œ– ๐›ง๐œ ๐›จ๐œ‚ ๐›ฉ๐œƒ๐œ— ๐›ช๐œ„ ๐›ซ๐œ… ๐›ฌ๐œ† ๐›ญ๐œ‡ ๐›ฎ๐œˆ ๐›ฏ๐œ‰ ๐›ฐ๐œŠ ๐›ฑ๐œ‹ ๐›ฒ๐œŒ ๐›ด๐œŽ๐œ ๐›ต๐œ ๐›ถ๐œ ๐›ท๐œ™๐œ‘ ๐›ธ๐œ’ ๐›น๐œ“ ๐›บ๐œ”