Status of Factorization Efforts, 5,000 < n <= 6,000

For each composite number in this range, Y.Amilin has done 1015 curves with B1=1M using his own ECM implementation. This should find most factors of 35 decimal digits or less.

For each composite number with less than 720 decimal digits in this range, Y.Amilin has done 2631 curves with B1=3M using his own ECM implementation.

Each composite number in this range has been tested by H.Bock with the gmp-ecm implementation of Pollard's p-1 algorithm with B1=10M and B2=10G.

Each composite number with less than 700 decimal digits in this range has been tested by H.Bock with the gmp-ecm implementation of Pollard's p-1 algorithm with B1=100M and B2=100G.

Each composite number with less than 200 decimal digits in this range has been tested by A.Kruppa with the gmp-ecm implementation of Pollard's p-1 algorithm with B1=1G and B2=1T.

Each composite number with less than 200 decimal digits in this range has been tested by H.Bock with the gmp-ecm implementation of the p+1 algorithm with B1=100M and B2=10G.

Extra efforts



Notation - "3000 @ 1M" means 3000 curves at B1=1,000,000 using gmp-ecm


Feedback: blair.kelly@att.net