Status of Factorization Efforts, 7,000 < n <= 8,000

For each composite number in this range, N.Daminelli has done 500 runs of gmp-ecm (5.0) with B1=250K According to the gmp-ecm documentation, this should find most factors of 30 digits or less.

Each composite number in this range with less than 498 digits has been tested by H. Bock with 904 runs with gmp-ecm.

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

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=100G.

Each composite number with less than 800 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 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

L7035B 2350 @ 3M  H.Bock
L7125A 2350 @ 3M  H.Bock
L7695B 2350 @ 3M  H.Bock
L7245B 2350 @ 3M  H.Bock
L7781  1000 @ 1M  S.Irvine

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

Feedback: blair.kelly@att.net