Welcome everyone,

This forum is mainly for discussion of the

NFSNET Project.

The goal of the

**NFSNET** project is to use the

**Number Field Sieve** to factor large numbers of interest to the Math Community. The number field sieve (

**NFS**) is the asymptotically fastest known algorithm for factoring large composite integers which have no known special form. It was introduced by J.M. Pollard in 1988 and later refined by various well-known members of the number theory community. More information can be found

here.

We've already completed factorizations of candidates from the Cunningham Most Wanted list and will scale up to larger projects as more participants come on board. Look at our

Announcements page for completed results.

Many of the numbers that we factor are from the

Cunningham Project. It may be interesting to note that Mersenne Numbers are a special subset of this larger project.

If you are interested in contributing to NFSNET, please look at the

Join page for instructions on how to get started.