Status of Factorization Efforts, 9,000 < n < 10,000

For each composite number in this range, N.Daminelli and H.Bock have done 422 runs of gmp-ecm with B1=250,000 According to the gmp-ecm documentation, this should find most factors of 30 digits or less.

N.Daminelli has completed 990 runs of gmp-ecm with B1=1M for the Aurifeuillan composites in this range.

Each composite number with less than 436 decimal digits in this range has been tested by N.Daminelli with 990 runs of gmp-ecm with B1=1M.

Each composite number in this range has been tested by A.Kruppa with the gmp-ecm implementation of the Pollard p-1 algorithm with B1=1M and B2=100M.

Each composite number with less than 800 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 1200 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 in this range has been tested with the p+1 algorithm with B1=100000 B2=2781811, starting points randomly chosen by A.Kruppa.

Each composite number in this range has been tested by N.Daminelli with the gmp-ecm implementation of the p+1 algorithm with B1=6M and B2=93G.

Extra efforts

L9123   15 @ 1M     B.Kelly
L9334   2450 @ 3M   S.Irvine
L9960   1000 @ 1M   S.Irvine
L9970   1000 @ 1M   S.Irvine
Notation - "3000 @ 1M" means 3000 curves at B1=1,000,000 using gmp-ecm


Feedback: blair.kelly@att.net