Go Back > Other Stuff > Archived Projects > NFSNET Discussion

Thread Tools
Old 2003-06-07, 12:14   #1
Jeff Gilchrist
Jeff Gilchrist's Avatar
Jun 2003
Ottawa, Canada

3·17·23 Posts
Arrow Welcome to NFSNET Discussion!

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.

Last fiddled with by Jeff Gilchrist on 2005-05-06 at 17:18
Jeff Gilchrist is offline  

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
nfsnet down fivemack NFSNET Discussion 9 2007-04-23 14:55
Questions about NFSNET... WraithX NFSNET Discussion 2 2007-03-03 23:56
Questions about NFSNET koders333 NFSNET Discussion 4 2005-09-26 13:19 Death NFSNET Discussion 15 2004-06-22 07:35
The future of NFSNET JHansen NFSNET Discussion 15 2004-06-01 19:58

All times are UTC. The time now is 21:43.

Wed Dec 8 21:43:42 UTC 2021 up 138 days, 16:12, 0 users, load averages: 1.49, 1.67, 1.67

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

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.