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

For each composite number in this range, B.Kelly has done 500 runs of gmp-ecm with B1=250,000. According to a table on the ECMNET web page, this should find most factors of 30 digits or less.

Each composite number in this range has been tested by H.Bock with the gmp-ecm implemenation 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=100G.

Extra efforts

L4305A  5070 @ 11M  B.Kelly

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

Feedback: blair.kelly@att.net