c64=2^211-1
----------------------------------
bash-2.05$ ecm 1000000 <c64
GMP-ECM 4c, by P. Zimmermann (Inria), 16 Dec 1999, with contributions from
T. Granlund, P. Leyland, C. Curry, A. Stuebinger, G. Woltman, JC. Meyrignac,
A. Yamasaki, and the invaluable help from P.L. Montgomery.
Input number is 3291009114642412084309938365114701009965471731267159726697218047 (64 digits)
recognized factor of 2^211-1, using special base-2 division
Using B1=1000000, B2=234709020, polynomial x^12, sigma=2019902010
Step 1 took 40797ms for 12982265 muls, 3 gcdexts
********** Factor found in step 1: 15193
Found probable prime factor of 5 digits: 15193
Composite cofactor 216613513765708687178959939782445929702196520191348629414679 has 60 digits
------------------------------------
bash-2.05$ ecm 200000000 <c60
GMP-ECM 4c, by P. Zimmermann (Inria), 16 Dec 1999, with contributions from
T. Granlund, P. Leyland, C. Curry, A. Stuebinger, G. Woltman, JC. Meyrignac,
A. Yamasaki, and the invaluable help from P.L. Montgomery.
Input number is 216613513765708687178959939782445929702196520191348629414679 (60 digits)
recognized factor of 2^211-1, using special base-2 division
Using B1=200000000, B2=316850584050, polynomial x^1, sigma=476676325
Step 1 took 9840433ms for -1668973187 muls, 3 gcdexts
Step 2 took 4296598ms for 1290895950 muls, 574174 gcdexts
********** Factor found in step 2: 60272956433838849161
Found probable prime factor of 20 digits: 60272956433838849161
Probable prime cofactor 3593875704495823757388199894268773153439 has 40 digits
-------------------------------------
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%                                                          %
%                           ECPP                           %
%                                                          %
%                  by Fran\c{c}ois MORAIN                  %
%                  morain@inria.inria.fr                   %
%                      Version V3.4.1                      %
%                                                          %
%           "3 is prime, 5 is prime, 7 is prime            %
%              so every odd number is prime"               %
%                                                          %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Working on 15193
% Performing a quick compositeness test
% This number might be prime
% Entering ECPP
% Starting phase 1: building the sequence of primes
% Pmax=5000
% N_0=15193
% next D is 0
% Factorization completed using sieve only
% D[[0]]=-1
% Factor= 211^1
% Factor= 3^2
% Factor= 2^3
% Cofactor is 1
% End of depth 0 at 0.036688 s

% Pmax=5000
% N_1=211
% next D is 0
% Factorization completed using sieve only
% D[[1]]=-1
% Factor= 7^1
% Factor= 5^1
% Factor= 3^1
% Factor= 2^1
% Cofactor is 1

% Time for building is 0.042639 s

% Starting phase 2: proving
% Starting proving job for step 0
% N_0 is prime
% Time for proof[0] is 0.000595 s

% Starting proving job for step 1
% Using complete factorization theorem
% N_1 is prime
% Time for proof[1] is 0.000846 s
% Time for building is 0.042639 s
% Time for proving  is 0.002142 s
% Total time is        0.044902 s
This number is prime
% Time for this number is 0.051009s

Working on 60272956433838849161
% Performing a quick compositeness test
% This number might be prime
% Entering ECPP
% Starting phase 1: building the sequence of primes
% Pmax=5000
% N_0=60272956433838849161
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[0]]=1
% Factor= 19^1
% Factor= 11^1
% Factor= 7^1
% Factor= 3^1
% Factor= 2^1
% End of depth 0 at 0.111705 s

% Pmax=5000
% N_1=6866365508525729
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 4
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[1]]=4
% A[[1]]=-68156254
% B[[1]]=-75531760
% m[[1]]=6866365576681984
% Factor= 337^1
% Factor= 37^1
% Factor= 2^9
% End of depth 1 at 0.145615 s

% Pmax=5000
% N_2=1075536953
% next D is 0
% Cofactor after sieve is a probable prime
% D[[2]]=-1
% Factor= 19^1
% Factor= 7^1
% Factor= 2^3
% End of depth 2 at 0.167526 s

% Pmax=5000
% N_3=1010843
% next D is 0
% Factorization completed using sieve only
% D[[3]]=-1
% Factor= 701^1
% Factor= 103^1
% Factor= 7^1
% Factor= 2^1
% Cofactor is 1
% End of depth 3 at 0.189060 s

% Pmax=5000
% N_4=701
% next D is 0
% Factorization completed using sieve only
% D[[4]]=-1
% Factor= 7^1
% Factor= 5^2
% Factor= 2^2
% Cofactor is 1

% Time for building is 0.110573 s

% Starting phase 2: proving
% Starting proving job for step 0
% N_0 is prime
% Time for proof[0] is 0.059237 s

% Starting proving job for step 1
% Entering the D=4 business
% E found
% Suggested twist(4)=1
% N_1 is prime
% Time for proof[1] is 0.026529 s

% Starting proving job for step 2
% N_2 is prime
% Time for proof[2] is 0.000646 s

% Starting proving job for step 3
% N_3 is prime
% Time for proof[3] is 0.001891 s

% Starting proving job for step 4
% Using complete factorization theorem
% N_4 is prime
% Time for proof[4] is 0.000734 s
% Time for building is 0.110573 s
% Time for proving  is 0.090444 s
% Total time is        0.201141 s
This number is prime
% Time for this number is 0.231932s

Working on 3593875704495823757388199894268773153439
% Performing a quick compositeness test
% This number might be prime
% Entering ECPP
% Starting phase 1: building the sequence of primes
% Pmax=7000
% N_0=3593875704495823757388199894268773153439
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 7
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 11
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[0]]=11
% A[[0]]=-119492948220095386659
% B[[0]]=-2968595377261744565
% m[[0]]=3593875704495823757507692842488868540099
% Factor= 71^1
% Factor= 3^1
% End of depth 0 at 0.480413 s

% Pmax=7000
% N_1=16872655889651754730083064988210650423
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 3
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[1]]=3
% A[[1]]=-7537309563630650372
% B[[1]]=-1886759841687061294
% m[[1]]=16872655889651754737620374551841300796
% Factor= 733^1
% Factor= 97^1
% Factor= 7^1
% Factor= 2^2
% End of depth 1 at 0.635580 s

% Pmax=7000
% N_2=8475195189967066335022600923757
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 3
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 4
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 7
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[2]]=7
% A[[2]]=-4742008845792046
% B[[2]]=-1276945734740196
% m[[2]]=8475195189967071077031446715804
% Factor= 3^2
% Factor= 337^1
% Factor= 107^1
% Factor= 23^1
% Factor= 2^2
% End of depth 2 at 0.856041 s

% Pmax=5000
% N_3=283860977371863285420427
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 3
% Cofactor after sieve is a probable prime
% D[[3]]=3
% A[[3]]=376709685845
% B[[3]]=-575480588169
% m[[3]]=283860977371486575734583
% Factor= 127^1
% Factor= 13^1
% Factor= 7^1
% Factor= 3^2
% End of depth 3 at 0.900149 s

% Pmax=5000
% N_4=2729091338308543891
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[4]]=1
% Factor= 2083^1
% Factor= 31^1
% Factor= 19^1
% Factor= 2^2
% End of depth 4 at 0.927952 s

% Pmax=5000
% N_5=556100793779
% next D is 0
% Cofactor after sieve is a probable prime
% D[[5]]=-1
% Factor= 97^1
% Factor= 2^1
% End of depth 5 at 0.941539 s

% Pmax=5000
% N_6=2866498937
% next D is 0
% Cofactor after sieve is a probable prime
% D[[6]]=-1
% Factor= 349^1
% Factor= 7^1
% Factor= 2^3
% End of depth 6 at 0.954574 s

% Pmax=5000
% N_7=146669
% next D is 0
% Factorization completed using sieve only
% D[[7]]=-1
% Factor= 991^1
% Factor= 37^1
% Factor= 2^2
% Cofactor is 1
% End of depth 7 at 0.976115 s

% Pmax=5000
% N_8=991
% next D is 0
% Factorization completed using sieve only
% D[[8]]=-1
% Factor= 11^1
% Factor= 5^1
% Factor= 3^2
% Factor= 2^1
% Cofactor is 1

% Time for building is 0.657866 s

% Starting phase 2: proving
% Starting proving job for step 0
% File /home/his/ECPP/Ecpp/Data/Weber/h1g1.cwdx does not exist
% tpber=-0.008586s
% j has been computed
% E found
% Suggested twist(11)=1
% N_0 is prime
% Time for proof[0] is 0.221573 s

% Starting proving job for step 1
% Entering the D=3 business
% E found
% Suggested twist(3)=1
% N_1 is prime
% Time for proof[1] is 0.219540 s

% Starting proving job for step 2
% File /home/his/ECPP/Ecpp/Data/Weber/h1g1.cwdx does not exist
% tpber=0.000082s
% j has been computed
% E found
% Suggested twist(7)=-1
% N_2 is prime
% Time for proof[2] is 0.129689 s

% Starting proving job for step 3
% Entering the D=3 business
% E found
% Suggested twist(3)=1
% N_3 is prime
% Time for proof[3] is 0.073998 s

% Starting proving job for step 4
% N_4 is prime
% Time for proof[4] is 0.028386 s

% Starting proving job for step 5
% N_5 is prime
% Time for proof[5] is 0.001354 s

% Starting proving job for step 6
% N_6 is prime
% Time for proof[6] is 0.000671 s

% Starting proving job for step 7
% N_7 is prime
% Time for proof[7] is 0.000546 s

% Starting proving job for step 8
% Using complete factorization theorem
% b=1
% Nonresidue is 6
% N_8 is prime
% Time for proof[8] is 0.001284 s
% Time for building is 0.657866 s
% Time for proving  is 0.661288 s
% Total time is        1.319295 s
This number is prime
% Time for this number is 1.366382s

% ==> Total time for the computations is 1.650834s