Information for cow-orkers

Please report any factorizations you find to me by email and inform me of which algorithm you used to find them. Additional information is also welcome: this may include NFS polynomials, factor base and large prime bounds and the size of the matrix or, for ECM, the number of curves run and the B1, B2 and sigma values for the successful curve. Most if not all of this information can be cut and pasted from the output of the factoring software used.

These are the ten Most Wanted Numbers

The first five holes in each table are

The smallest composite remaining to be factored has 176 digits. There are 10 composites with fewer than 190 digits and 88 with at least 1000 digits.

For those wishing to factor with the SNFS algorithm, this table contains the a and n values sorted by SNFS-difficulty (defined here as log₁₀ (n.aⁿ) ) for those unfactored numbers which have SNFS-difficulty under 265. There are 10 entries in this table, some of which may have been reserved.

The ECMNet server running at 109.109.166.184:8194 is now loaded with the GCW composites. Curves are being allocated at B1=43M, equivalent to a t50 test. Please note that this server is still version 2.x and does not work with V3.0 clients.

The following numbers have been reserved. They have been removed from the ECMNet server. Please mail me if you would like to reserve some numbers for yourself. Note that ECM occasionally leaves relatively small "runts". Please assume that anything smaller than a C165 will be reserved and/or factored by me by the time you read this information.

Sam Wagstaff is currently running extensive ECM pre-testing on all the candidates with SNFS difficulty between 260 and 270 digits with the aim of ultimately completing them by SNFS. They have not been removed from the ECM server and other workers are welcome to help out with the pre-testing; B1 values should be at least 110M.