Difference between revisions of "PrimeGrid"

Revision as of 14:06, 1 February 2019

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. As of August 2010, there are about 5,000 active participants (on about 11,500 host computers) from 89 countries, reporting about 65 teraflops.

321 Prime Search searching for mega primes of the form 3×2ⁿ±1.
Cullen numbers / Woodall numbers Search: searching for mega primes of forms n×2ⁿ±1
Extended Sierpinski Problem: helping solve the Extended Sierpinski Problem.
Generalized Fermat Number Search: searching for megaprimes of the form b^2ⁿ+1.
Prime Sierpinski Project: helping Prime Sierpinski Project solve the Prime Sierpinski Problem.
Proth Prime Search: searching for primes of the form k×2ⁿ+1.
Seventeen or Bust: helping to solve the Sierpinski problem.
Sierpinski/Riesel Base 5: helping to solve the Sierpinski/Riesel Base 5 Problem.
Sophie Germain Prime Search: searching for primes p and 2p+1.
The Riesel problem: helping to solve the Riesel conjecture.

@@ Line 9: / Line 9: @@
 *Prime Sierpinski Project: helping Prime Sierpinski Project solve the [[Prime Sierpinski Problem]].
 *[[Proth Prime]] Search: searching for primes of the form k&times;2<sup>n</sup>+1.
-*[[Seventeen Or Bust]]: helping to solve the [[Sierpinski problem]].
+*[[Seventeen or Bust]]: helping to solve the [[Sierpinski problem]].
 *Sierpinski/Riesel Base 5: helping to solve the [[Sierpinski/Riesel Base 5]] Problem.
 *[[Sophie Germain Prime]] Search: searching for primes p and 2p+1.