Difference between revisions of "NFS@home"
From BOINC Wiki
(NFS data) |
(adding into template) |
||
| Line 1: | Line 1: | ||
| − | + | {{Projects | |
| − | + | |1=NFS@home | |
| − | + | |2=http://escatter11.fullerton.edu/nfs/ | |
| − | + | |3=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. | |
| − | + | |4=Macintosh, Linux, FreeBSD, Windows | |
| − | + | |5=not available | |
| − | + | }} | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
Revision as of 22:55, 3 June 2016
Project name: NFS@home
Project URL: http://escatter11.fullerton.edu/nfs/
Description: 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.
Platforms: Macintosh, Linux, FreeBSD, Windows
Calculates using GPUs: not available
Has an OpenGL screen saver: {{{6}}}
