Difference between revisions of "NFS@home"
From BOINC Wiki
(adding into template) |
(improving project description) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
| + | [[File:NFS Logo.jpg|200px|right]] | ||
{{Projects | {{Projects | ||
|1=NFS@home | |1=NFS@home | ||
| Line 4: | Line 5: | ||
|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. | |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 | |4=Macintosh, Linux, FreeBSD, Windows | ||
| − | |5= | + | |5=No |
| + | |6=No | ||
}} | }} | ||
Latest revision as of 21:35, 14 February 2017
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: No
Has an OpenGL screen saver: No
