| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "PrimeGrid"
m |
(links corrected) |
||
| Line 1: | Line 1: | ||
==Overview== | ==Overview== | ||
| − | '''PrimeGrid''' is a [[distributed computing]] project for searching for [[prime number]]s of world-record size. It makes use of the [[BOINC|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 [[FLOPS|teraflops]]. | + | '''PrimeGrid''' is a [[distributed computing]] project for searching for [[prime number]]s of world-record size. It makes use of the [[BOINC|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 [[Computing power#FLOPS|teraflops]]. |
==Sub-projects== | ==Sub-projects== | ||
*[[321 Prime Search]] searching for mega primes of the form 3×2<sup>n</sup>±1. | *[[321 Prime Search]] searching for mega primes of the form 3×2<sup>n</sup>±1. | ||
*[[Cullen number]]s / [[Woodall number]]s Search: searching for mega primes of forms n×2<sup>n</sup>±1 | *[[Cullen number]]s / [[Woodall number]]s Search: searching for mega primes of forms n×2<sup>n</sup>±1 | ||
| − | *[[Extended Sierpinski | + | *[[Extended Sierpinski problem]]: helping solve the Extended Sierpinski Problem. |
| − | *[[Generalized Fermat | + | *[[Generalized Fermat number]] Search: searching for megaprimes of the form b<sup>2<sup>n</sup></sup>+1. |
| − | *Prime Sierpinski | + | *Prime Sierpinski project: helping Prime Sierpinski Project solve the [[Prime Sierpinski problem]]. |
*[[Proth Prime]] Search: searching for primes of the form k×2<sup>n</sup>+1. | *[[Proth Prime]] Search: searching for primes of the form k×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 | + | *Sierpinski/Riesel Base 5: helping to solve the [[Sierpinski/Riesel base 5]] Problem. |
| − | *[[Sophie Germain | + | *[[Sophie Germain prime]] Search: searching for primes p and 2p+1. |
*The Riesel problem: helping to solve the [[Riesel conjecture]]. | *The Riesel problem: helping to solve the [[Riesel conjecture]]. | ||
Revision as of 22:58, 3 February 2019
Overview
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.
Sub-projects
- 321 Prime Search searching for mega primes of the form 3×2n±1.
- Cullen numbers / Woodall numbers Search: searching for mega primes of forms n×2n±1
- Extended Sierpinski problem: helping solve the Extended Sierpinski Problem.
- Generalized Fermat number Search: searching for megaprimes of the form b2n+1.
- Prime Sierpinski project: helping Prime Sierpinski Project solve the Prime Sierpinski problem.
- Proth Prime Search: searching for primes of the form k×2n+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.
