![]() |
![]() |
#1 |
1976 Toyota Corona years forever!
"Wayne"
Nov 2006
Saskatchewan, Canada
52×211 Posts |
![]()
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? |
![]() |
![]() |
![]() |
#2 |
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
11·389 Posts |
![]()
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.
|
![]() |
![]() |
![]() |
#3 |
1976 Toyota Corona years forever!
"Wayne"
Nov 2006
Saskatchewan, Canada
122338 Posts |
![]()
My bad for not checking there first....
|
![]() |
![]() |
![]() |
#4 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101ร103 Posts
101010100001012 Posts |
![]()
I was hoping for a 100M TF option. BTW, how far would make sense and the settings for P-1 (or ECM)?
|
![]() |
![]() |
![]() |
#5 |
Dec 2003
Hopefully Near M48
2·3·293 Posts |
![]()
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.
|
![]() |
![]() |
![]() |
#6 | |
Sep 2008
Krefeld, Germany
111001102 Posts |
![]() Quote:
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. |
|
![]() |
![]() |
![]() |
#7 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
235038 Posts |
![]()
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 |
![]() |
![]() |
![]() |
#8 | |
Banned
"Luigi"
Aug 2002
Team Italia
485710 Posts |
![]() Quote:
Luigi |
|
![]() |
![]() |
![]() |
#9 | |
Undefined
"The unspeakable one"
Jun 2006
My evil lair
2·32·7·53 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#10 | |
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2D7816 Posts |
![]() Quote:
Might not be economically viable though. Paul |
|
![]() |
![]() |
![]() |
#11 |
Undefined
"The unspeakable one"
Jun 2006
My evil lair
2·32·7·53 Posts |
![]()
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.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
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 |