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 the gmp-ecm documentation, this should find most factors of 30 digits or less.

For each composite number less than 428 decimal digits, N.Daminelli has done 2440 runs of gmp-ecm with B1=3M.

Each composite number in this range has been tested by N.Daminelli with the gmp-ecm implemenation of Pollard's p-1 algorithm with B1=100M and B2=1127G.

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 implemenation of Pollard's p+1 algorithm with B1=50M and B2=756G.

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

L4035A  2440 @ 3M, P-1: 30G/3137T, P+1: 3G/514T  N.Daminelli
L4065A  2440 @ 3M, P-1: 30G/3137T, P+1: 3G/514T  N.Daminelli
L4185B  2440 @ 3M, P-1: 30G/3137T, P+1: 3G/514T  N.Daminelli
L4305A  8510 @ 43M  B.Kelly, B.Rea sieving
L4395A  2440 @ 3M, P-1: 30G/3137T, P+1: 3G/514T  N.Daminelli
L4545A  2440 @ 3M, P-1: 30G/3137T, P+1: 3G/514T  N.Daminelli

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

Feedback: blair.kelly@att.net