View Single Post
Old 2003-03-07, 19:29   #8
Xyzzy
 
Xyzzy's Avatar
 
"Mike"
Aug 2002

17×463 Posts
Default

It looks like I can get away with a 480K FFT... If my calculations are correct, it looks like it will take ~70 days... This is with error checking on, and the default radix... I'll try Glucas next to compare the speed...
[code:1][Xyzzy:~/Desktop/mlucas] mvang% nice -19 ./mlucas
looking for worktodo.ini file...
no worktodo.ini file found...switching to interactive mode.
Enter exponent, FFT length in K (set K = 0 for default FFT length) >9167489, 480
Enter 'y' to run a self-test, <return> for a full LL test >
Enter index of radix set to be used for the FFT:
(See file fft_radix.txt for a list of available choices; enter -1 to get the default) >-1
Enter 'y' to enable per-iteration error checking, <return> for no error checking >y
p is prime...proceeding with Lucas-Lehmer test...
M( 9167489 ): using FFT length 480K = 491520 8-byte floats.
this gives an average 18.6513041178385 bits per digit
INFO: Using real* 8 for FFT sincos and DWT weights tables inits.
WARN: radix set -1 not available - using defaults.
Using complex FFT radices 15 16 32 32
M( 9167489 ) iteration = 2000 clocks = 00:39:09.309. Res64: 313B5721DFABE7CD
WARN: radix set -1 not available - using defaults.
Using complex FFT radices 15 16 32 32
M( 9167489 ) iteration = 4000 clocks = 00:21:57.501. Res64: D9783AAA0FF5EF2D
WARN: radix set -1 not available - using defaults.
Using complex FFT radices 15 16 32 32
^C[/code:1]
21 [ENTER] 60 × 57.501 + 9167489 [ENTER] 2000 ÷ × 86400 ÷
Xyzzy is offline   Reply With Quote