alte version von ATH:yoyo hat geschrieben:ATH im mersenneforum hat ecm mal mit MPIR statt GMP übersetzt. Diese Version ist wesentlich schneller. Wäre schön mal ein Test auf Intel und AMD auf Win64 zu bekommen.
Hier ist die Version http://www.hoegge.dk/mersenne/ecm63mpir ... smredc.zip
yoyo
Code: Alles auswählen
GMP-ECM 6.3 [configured with GMP 5.0.1 and --enable-asm-redc] [ECM]
Input number is 2486977010...7938509483 (65050 digits)
[Sun Jan 23 12:47:02 2011]
Using special division for factor of 2^216091+1
Using B1=250000, B2=126038650, polynomial Dickson(3), sigma=3076591651
dF=1344, k=7, d=12180, d2=11, i0=10
Expected number of curves to find a factor of n digits:
35 40 45 50 55 60 65 70 75 80
4954 70922 1226642 2.5e+007 5.8e+008 1.6e+010 2.7e+013 4e+018 5.3e+023 Inf
Step 1 took 7216794ms
Estimated memory usage: 1698M
Initializing tables of differences for F took 3572ms
Computing roots of F took 83866ms
Building F from its roots took 127687ms
Computing 1/F took 47580ms
Initializing table of differences for G took 24336ms
Computing roots of G took 59640ms
Building G from its roots took 126953ms
Computing roots of G took 59702ms
Building G from its roots took 126954ms
Computing G * H took 32776ms
Reducing G * H mod F took 61682ms
Computing roots of G took 59686ms
Building G from its roots took 126782ms
Computing G * H took 32573ms
Reducing G * H mod F took 61480ms
Computing roots of G took 59483ms
Building G from its roots took 128903ms
Computing G * H took 32916ms
Reducing G * H mod F took 62962ms
Computing roots of G took 61090ms
Building G from its roots took 128155ms
Computing G * H took 32822ms
Reducing G * H mod F took 62136ms
Computing roots of G took 61292ms
Building G from its roots took 127828ms
Computing G * H took 32417ms
Reducing G * H mod F took 59904ms
Computing roots of G took 60029ms
Building G from its roots took 128124ms
Computing G * H took 32760ms
Reducing G * H mod F took 62042ms
Computing polyeval(F,G) took 229509ms
Computing product of all F(g_i) took 10639ms
Step 2 took 2408546ms
Expected time to find a factor of n digits:
35 40 45 50 55 60 65 70 75 80
1.51y 21.65y 374.40y 7642y 177479y 5e+006y 8e+009y 1e+015y 2e+020y Inf
Code: Alles auswählen
GMP-ECM 6.3 [configured with GMP 5.0.1 and --enable-asm-redc] [ECM]
Input number is 2486977010...7938509483 (65050 digits)
[Sun Jan 23 09:54:08 2011]
Using special division for factor of 2^216091+1
Using B1=250000, B2=126038650, polynomial Dickson(3), sigma=1333584536
dF=1344, k=7, d=12180, d2=11, i0=10
Expected number of curves to find a factor of n digits:
35 40 45 50 55 60 65 70 75 80
4954 70922 1226642 2.5e+007 5.8e+008 1.6e+010 2.7e+013 4e+018 5.3e+023 Inf
Step 1 took 3117898ms
Estimated memory usage: 1698M
Initializing tables of differences for F took 1856ms
Computing roots of F took 40904ms
Building F from its roots took 93226ms
Computing 1/F took 27909ms
Initializing table of differences for G took 11185ms
Computing roots of G took 26489ms
Building G from its roots took 93008ms
Computing roots of G took 26442ms
Building G from its roots took 92789ms
Computing G * H took 21840ms
Reducing G * H mod F took 33821ms
Computing roots of G took 26473ms
Building G from its roots took 92977ms
Computing G * H took 21933ms
Reducing G * H mod F took 34258ms
Computing roots of G took 26692ms
Building G from its roots took 94443ms
Computing G * H took 21871ms
Reducing G * H mod F took 33961ms
Computing roots of G took 27191ms
Building G from its roots took 92712ms
Computing G * H took 22074ms
Reducing G * H mod F took 34133ms
Computing roots of G took 26677ms
Building G from its roots took 93288ms
Computing G * H took 21840ms
Reducing G * H mod F took 34289ms
Computing roots of G took 26458ms
Building G from its roots took 93023ms
Computing G * H took 21871ms
Reducing G * H mod F took 34242ms
Computing polyeval(F,G) took 142726ms
Computing product of all F(g_i) took 8720ms
Step 2 took 1501509ms
Expected time to find a factor of n digits:
35 40 45 50 55 60 65 70 75 80
264.89d 10.39y 179.68y 3668y 85176y 2e+006y 4e+009y 6e+014y 8e+019y Inf