Welcome to NFSNET Discussion!
 

Welcome everyone,

This forum is mainly for discussion of the [url=http://www.nfsnet.org]NFSNET Project[/url].

The goal of the [b]NFSNET[/b] project is to use the [b]Number Field Sieve[/b] to factor large numbers of interest to the Math Community. The number field sieve ([b]NFS[/b]) 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 [url=http://www.nfsnet.org/faq-nfs.html]here[/url].

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 [url=http://www.nfsnet.org/announcements.html]Announcements[/url] page for completed results.

Many of the numbers that we factor are from the [url=http://www.cerias.purdue.edu/homes/ssw/cun/]Cunningham Project[/url]. 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 [url=http://www.nfsnet.org/join.html]Join[/url] page for instructions on how to get started.