About NFS@Home
NFS@Home is a research project that uses Internet-connected computers to do the lattice sieving step in the Number Field Sieve factorization of large integers. As a young school student, you gained your first experience at breaking an integer into prime factors, such as 15 = 3 * 5 or 35 = 5 * 7. NFS@Home is a continuation of that experience, only with integers that are hundreds of digits long. Most recent large factorizations have been done primarily by large clusters at universities. With NFS@Home you can participate in state-of-the-art factorizations simply by downloading and running a free program on your computer.
Integer factorization is interesting from both mathematical and practical perspectives. Mathematically, for instance, the calculation of multiplicative functions in number theory for a particular number require the factors of the number. Likewise, the integer factorization of particular numbers can aid in the proof that an associated number is prime. Practically, many public key algorithms, including the RSA algorithm, rely on the fact that the publicly available modulus cannot be factored. If it is factored, the private key can be easily calculated. Until quite recently, RSA-512, which uses a 512-bit modulus (155 digits), was commonly used but can now be easily broken.
Many of the numbers that we are factoring are chosen from the Cunningham project. Started in 1925, it is one of the oldest continuously ongoing projects in computational number theory. The third edition of the book, published by the American Mathematical Society in 2002, is available as a free download. All results obtained since, including those of NFS@Home, are available on the Cunningham project website.
NFS@Home is hosted at California State University Fullerton, and is supported in part by the National Science Foundation through ACCESS resources provided by the Texas Advanced Computing Center, the San Diego Supercomputer Center, the National Center for Supercomputing Applications, and Purdue University under grant number DMS100027.
Getting started
- Read our rules and policies
- This project uses BOINC. If you are already running BOINC, select Attach to Project. If not, sign up or download BOINC.
- When prompted, select NFS@Home from the list of projects.
- If you are running a command-line or pre-5.0 version of BOINC, create an account first.
- If you have any problems, get help here.
Everything else
Your account
Join NFS@Home
Factor numbers hundreds of digits long with spare time on your own machine. Setup takes a few minutes.
Join NFS@Home Download BOINC firstAlready joined? Log in.
News
CUDA-based GPU sieving test
A new GPU lattice sieve for NFS, cuda-sieve, was recently released. A new app has been added to NFS@Home to test this. Currently, it's only available for nVidia Ampere or higher GPUs running x86_64 Linux. Once the code stabilizes, additional platforms will be added.
17 Aug 2026, 18:55:54 UTC
· Discuss
Another new Cunningham project record
NFS@Home again set a new Cunningham project record for the largest penultimate prime factor. 3,709+ factors into 159-digit and 168-digit prime factors, beating the 155-digit record set in April. Congratulations again to all of the project volunteers!
23 Jul 2026, 23:20:37 UTC
· Discuss
BOINC Pentathlon
Another year, another BOINC Pentathlon. Once again, welcome back! NFS@Home has been chosen for the Sprint discipline starting May 16 at midnight UTC. Good luck to all! (Including the server!)
15 May 2026, 16:53:18 UTC
· Discuss
New Cunningham project record
The recently completed factorization of 12,311- into 155-digit and 181-digit prime factors set a new Cunningham project record for the largest penultimate prime factor. Congratulations to all of the project volunteers!
8 Apr 2026, 23:05:00 UTC
· Discuss
Server upgrade is complete
The server upgrade is complete. Thanks for your patience during the few hours of downtime.
1 Mar 2026, 1:46:28 UTC
· Discuss
... more
News is available as an RSS feed

