Primegrid
 |
|
| Original author(s) | Rytis Slatkevičius |
|---|---|
| Initial release | June 12, 2005 |
| Development status | Active |
| Project goal(s) | Finding prime numbers of various types |
| Software used | BOINC, PRPNet, Genefer, LLR, PFGW |
| Funding | Corporate sponsorship |
| Average performance | 1,324.647 TFLOPS |
| Active users | 6,029 (October 2016) |
| Total users | 92,470 |
| Active hosts | 9,063 |
| Total hosts | 272,405 |
| Website | primegrid.com |
PrimeGrid is a distributed computing project for searching for prime numbers of world-record size. It makes use of the Berkeley Open Infrastructure for Network Computing (BOINC) platform.
PrimeGrid started in June 2005 under the name Message@home and tried to decipher text fragments hashed with MD5. Message@home was a test to port the BOINC scheduler to Perl to obtain greater portability. After a while the project attempted the RSA factoring challenge trying to factor RSA-640. After RSA-640 was factored by an outside team in November 2005, the project moved on to RSA-768. With the chance to succeed too small, it discarded the RSA challenges, was renamed to PrimeGrid, and started generating a list of the first prime numbers. At 210,000,000,000 the primegen subproject was stopped.
In June 2006, dialog started with Riesel Sieve to bring their project to the BOINC community. PrimeGrid provided PerlBOINC support and Riesel Sieve was successful in implementing their sieve as well as a prime finding (LLR) application. With collaboration from Riesel Sieve, PrimeGrid was able to implement the LLR application in partnership with another prime finding project, Twin Prime Search. In November 2006, the TPS LLR application was officially released at PrimeGrid. Less than two months later, January 2007, the record twin was found by the original manual project. PrimeGrid and TPS then advanced their search for even larger twin primes.
The summer of 2007 was very active as the Cullen and Woodall prime searches were launched. In the Fall, more prime searches were added through partnerships with the Prime Sierpinski Problem and 3*2^n-1 Search projects. Additionally, two sieves were added: the Prime Sierpinski Problem combined sieve which includes supporting the Seventeen or Bust sieve; and the combined Cullen/Woodall sieve.
In the Fall of 2007, PrimeGrid migrated its systems from PerlBOINC to standard BOINC software.
Since September 2008, PrimeGrid is also running a Proth prime sieving subproject.
In January 2010 the subproject Seventeen or Bust (for solving The Sierpinski Problem) was added. The calculations for the Riesel problem followed in March 2010.
...
Wikipedia