-   NFSNET Discussion (
-   -   Welcome to NFSNET Discussion! (

Jeff Gilchrist 2003-06-07 12:14

Welcome to NFSNET Discussion!
Welcome everyone,

This forum is mainly for discussion of the [url=]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=]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=]Announcements[/url] page for completed results.

Many of the numbers that we factor are from the [url=]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=]Join[/url] page for instructions on how to get started.

All times are UTC. The time now is 03:37.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.