Volunteer computing for the Number Field Sieve, hosted at Cal State Fullerton

Theme

Sieving now

Updated 3 minutes ago

Each application name links to its detailed status page.
ApplicationNumberTypeSieving progress
lasieved C171_230916_i6791GNFS-171
100%
lasieved C169_1920_2636GNFS-169
100%
lasieved C163_434340_3199GNFS-163
100%
lasievedand 1 more number under lasieved
lasievee_small C190_3366_i2272GNFS-190
100%
lasievee_small C191_1074_i2214GNFS-191
42%
lasievee_small C178_18528_i1658GNFS-178
5%
lasievee_smalland 2 more numbers under lasievee_small
lasievee C193_1476_1325GNFS-193
22%
lasievee 11m6_271SNFS-282
1%
lasievef_small C200_785232_i11742GNFS-200
99%
lasievef_small 12m7_319GNFS-201
0%
lasievef_small 13_2_978m1SNFS-294
0%
lasievef_smalland 1 more number under lasievef_small
lasievef 2,1129+SNFS-340
100%
lasievef 2,1139+SNFS-323
75%
lasievef 11,326+SNFS-340
67%
cudasieve 9m5_685LSNFS-261 (quartic)
100%
cudasieve C207_2712_2082GNFS-207
34%

Server status

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

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 first

Already joined? Log in.

News

Testing GPU Sieving on Apple silicon Macs
A test version of the GPU sieving application is now available for Apple silicon Macs (M1 and newer). The cuda-sieve code has been ported to Apple’s Metal GPU API, allowing the integrated GPUs in Apple M-series processors to participate in the sieving work.

This is a new port and has had relatively limited testing, so additional testing across the different generations of Apple silicon would be very helpful. If you have an M1, M2, M3, M4, or newer Mac, please give it a try and let us know how it performs.
17 Sep 2026, 7:02:21 UTC · Discuss


GPU sieving
Work has progressed nicely on the GPU sieving apps based on cuda-sieve. Linux and Windows apps are now available for NVIDIA GPUs, with support extended to Maxwell (such as the GTX 970) and newer GPUs with at least 4 GB of GPU memory.

For AMD, the code has been ported using HIP, and a Windows app is now available supporting all RDNA-based GPUs (Radeon RX 5000 series and newer) with at least 4 GB of GPU memory.

If you have a supported GPU, give it a try!
12 Sep 2026, 20:02:19 UTC · Discuss


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


... more

News is available as an RSS feed   RSS

User of the day

User profile Profilem4rtyn
Hi, my name is M4rtyn I am 50 years old and live in Birmingham England. I have been continuously Involved in distributed computing since 1999...