GMP-ECM 7.0-dev [configured with GMP 6.0.0, --enable-asm-redc] [ECM]
Resuming ECM residue saved by ATH@XPS with GMP-ECM 7.0-dev on Thu Apr 30 21:40:38 2015 
Input number is 2^1277-1 (385 digits)
Using MODMULN [mulredc:2, sqrredc:1]
Using B1=110000000-110000000, B2=2000000000000, polynomial Dickson(30), sigma=2:17131303532575632079
dF=524288, k=1, d=5705700, d2=17, i0=3
Expected number of curves to find a factor of n digits:
35	40	45	50	55	60	65	70	75	80
30	115	517	2614	14756	91143	612095	4432214	3.4e+007	2.9e+008
Step 1 took 15ms
Using 44 small primes for NTT
Estimated memory usage: 4117M
Initializing tables of differences for F took 10233ms
Computing roots of F took 113725ms
Building F from its roots took 73039ms
Computing 1/F took 26989ms
Initializing table of differences for G took 1076ms
Computing roots of G took 98874ms
Building G from its roots took 70231ms
Computing polyeval(F,G) took 138623ms
Computing product of all F(g_i) took 827ms
Step 2 took 535427ms
Expected time to find a factor of n digits:
35	40	45	50	55	60	65	70	75	80
4.40h	17.14h	3.20d	16.20d	91.44d	1.55y	10.39y	75.25y	583.47y	4880y
Peak memory usage: 4400MB


GMP-ECM 7.0-dev [configured with GMP 6.0.0, --enable-asm-redc] [ECM]
Resuming ECM residue saved by ATH@XPS with GMP-ECM 7.0-dev on Thu Apr 30 21:40:38 2015 
Input number is 2^1277-1 (385 digits)
Using MODMULN [mulredc:2, sqrredc:1]
Using B1=110000000-110000000, B2=2000000000000, polynomial Dickson(30), sigma=2:17131303532575632079
dF=524288, k=2, d=5705700, d2=17, i0=3
Expected number of curves to find a factor of n digits:
35	40	45	50	55	60	65	70	75	80
28	108	481	2425	13614	83813	561226	4053459	3.1e+007	2.6e+008
Step 1 took 31ms
Using 44 small primes for NTT
Estimated memory usage: 4117M
Initializing tables of differences for F took 14710ms
Computing roots of F took 113522ms
Building F from its roots took 66425ms
Computing 1/F took 26754ms
Initializing table of differences for G took 1076ms
Computing roots of G took 97033ms
Building G from its roots took 68157ms
Computing roots of G took 103663ms
Building G from its roots took 79748ms
Computing G * H took 17550ms
Reducing  G * H mod F took 15148ms
Computing polyeval(F,G) took 136267ms
Computing product of all F(g_i) took 561ms
Step 2 took 742581ms
Expected time to find a factor of n digits:
35	40	45	50	55	60	65	70	75	80
5.75h	22.26h	4.14d	20.84d	117.01d	1.97y	13.22y	95.45y	738.42y	6156y
Peak memory usage: 4593MB