![]() |
|
|
#12 |
|
"Åke Tilander"
Apr 2011
Sandviken, Sweden
2·283 Posts |
Well, if its trivial (that is not requiering too much work) I would, for one, humbly ask for it.
Last fiddled with by aketilander on 2012-04-22 at 21:50 |
|
|
|
|
|
#13 |
|
P90 years forever!
Aug 2002
Yeehaw, FL
5·11·137 Posts |
|
|
|
|
|
|
#14 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
100110010110102 Posts |
|
|
|
|
|
|
#15 | |
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
170148 Posts |
Quote:
|
|
|
|
|
|
|
#16 | |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
24·389 Posts |
Quote:
|
|
|
|
|
|
|
#17 |
|
Jun 2003
117328 Posts |
A billion digit exponent (p ~ 3.3e9) would take 40 times as much time as a 600M exponent -- not 6 times.
|
|
|
|
|
|
#18 | |
|
"Åke Tilander"
Apr 2011
Sandviken, Sweden
2·283 Posts |
Quote:
Exponent Iterationtime GHz-Days according to Mersenne aries M345678877 31.8 ms. 5,450 M595999993 57.0 ms. 16,440 M3321928171 don't know 91,630 If I first compare the work needed to complete M595999993 in relation to M345678877: To be more exact if I divide 16440/5450 = 3.02 If I use the interationtime instead I get 3.09 Concerning the billion digit exponent M3321928171 I cannot do a practical test to get an estimation of the iteration time, but my guess was that I could use the number of GHz-Days needed to get a rough estimation of the time needed for a LL-test of that expo. Thinking about it 91630 GHz-Days seems to be very little. Already the exponent is 5.6 times as large as 595999993, that is it would requrie 5.6 times as many iterations. A LL-test would use a FFT size of 183M instead of 32M, that is 5.7 times as large FFTs. 5.6*5.7 = 32 Maybe, James, the calculator on Mersenne aries is wrong? |
|
|
|
|
|
|
#19 |
|
"James Heinrich"
May 2004
ex-Northern Ontario
11·311 Posts |
Above 596M yes, it is wrong. For larger exponents I have (or rather, George's code has) no timing data on which to base the credit, and I make no effort to extrapolate FFT sizes and timings, I just return a value based on the assumption that the 32M FFT can be used indefinitely, which of course isn't correct.
|
|
|
|
|
|
#20 |
|
"Åke Tilander"
Apr 2011
Sandviken, Sweden
2·283 Posts |
Well, so it is surely still without reach to LL-test a billion digit exponent, but we are down to something like 35 years and that's not too bad.
|
|
|
|
|
|
#21 | |
|
"Lucan"
Dec 2006
England
2×3×13×83 Posts |
Quote:
Eric Morecambe: "No. I'm playing the right notes, but not necessarily in the right order". http://www.youtube.com/watch?v=R7GeKLE0x3s Last fiddled with by davieddy on 2012-04-24 at 02:35 |
|
|
|
|
|
|
#22 |
|
"Mike"
Aug 2002
202A16 Posts |
Too many notes!
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Force FFT-size to be used | kruoli | Software | 4 | 2017-11-17 18:14 |
| Pi(x) value for x at 10^16 size | edorajh | Computer Science & Computational Number Theory | 6 | 2017-03-08 20:28 |
| Size optimization | Sleepy | Msieve | 14 | 2011-10-20 10:27 |
| Exponent Size Gap | Mini-Geek | PrimeNet | 8 | 2007-03-25 07:29 |
| FFT-Size | andi314 | Lounge | 14 | 2007-01-22 00:21 |