| 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 |
m |
||
| Line 3: | Line 3: | ||
==Sub-projects== | ==Sub-projects== | ||
| − | *[[PrimeGrid 321 Prime Search]] searching for mega primes of the form {{Kbn|±|3|2|n}}. | + | *Type Proth: |
| − | + | :[[PrimeGrid 321 Prime Search|321 Prime Search]] searching for mega primes of the form {{Kbn|±|3|2|n}}. | |
| − | + | :[[PrimeGrid 27121 Prime Search|27121 Prime Search]] searching for primes of the forms {{Kbn|±|27|2|n}} and {{Kbn|±|121|2|n}}. | |
| − | + | :[[PrimeGrid Proth Prime Search|Proth Prime Search]]: searching for primes of the form {{Kbn|+|k|2|n}}. | |
| − | *[[PrimeGrid Extended Sierpiński Project]]: helping solve the [[Extended Sierpiński Problem]]. | + | :[[PrimeGrid Proth Prime Search Extended|Proth Prime Search Extended]]: searching for primes of the form {{Kbn|+|k|2|n}}. |
| − | + | :[[PrimeGrid Proth Mega Prime Search|Proth Mega Prime Search]]: searching for primes of the form {{Kbn|+|k|2|n}}. | |
| − | + | ||
| − | *[[PrimeGrid Generalized Fermat Prime Search]]: searching for megaprimes of the form {{Kbn|+|1|b|2<sup>{{Vn}}</sup>}}. | + | *Type Sierpiński: |
| − | + | :[[PrimeGrid Seventeen or Bust|Seventeen or Bust]]: helping to solve the [[Sierpiński problem]]. | |
| − | *[[PrimeGrid | + | :[[PrimeGrid Extended Sierpiński Project|Extended Sierpiński Project]]: helping solve the [[Extended Sierpiński Problem]]. |
| − | + | :[[PrimeGrid Prime Sierpiński Problem|Prime Sierpiński Problem]]: helping Prime Sierpiński Project solve the [[Prime Sierpiński problem]]. | |
| − | *[[PrimeGrid | + | :[[PrimeGrid Sierpiński base 5|Sierpiński base 5]]: helping to solve the [[Sierpiński-Riesel Base 5]] Problem. |
| − | + | :[[PrimeGrid Riesel base 5|Riesel base 5]]: helping to solve the [[Sierpiński-Riesel Base 5]] Problem. | |
| − | + | ||
| + | *Type Riesel: | ||
| + | :[[PrimeGrid The Riesel Problem|The Riesel Problem]]: helping to solve the [[Riesel problem]]. | ||
| + | |||
| + | *Type Fermat: | ||
| + | :[[PrimeGrid Generalized Fermat Prime Search|Generalized Fermat Prime Search]]: searching for megaprimes of the form {{Kbn|+|1|b|2<sup>{{Vn}}</sup>}}. | ||
| + | :[[PrimeGrid Fermat Divisor Search|Fermat Divisor Search]]: searching for large prime divisors of [[Fermat number]]s. | ||
| + | |||
| + | *Type Cullen/Woodall: | ||
| + | :[[PrimeGrid Cullen Prime Search|Cullen Prime Search]]: searching for mega primes of the forms {{Kbn|+|n|2|n}}. | ||
| + | :[[PrimeGrid Woodall Prime Search|Woodall Prime Search]]: searching for mega primes of the forms {{Kbn|-|n|2|n}}. | ||
| + | :[[PrimeGrid Generalized Cullen Prime Search|Generalized Cullen Prime Search]]: searching for primes of the form {{Kbn|+|n|b|n}}. | ||
| + | |||
| + | *Others: | ||
| + | :[[PrimeGrid AP27 Search|AP27 Search]]: searching for an arithmetic progression ({{V|p}}+{{V|d}}<sup>{{Vn}}</sup>) that yields primes for 27 consecutive values of {{Vn}}. | ||
| + | :[[PrimeGrid Sophie Germain Search|Sophie Germain Search]]: searching for primes {{V|p}} and 2{{V|p}}+1, and twin primes {{V|p}} and {{V|p}}+2. | ||
==References== | ==References== | ||
Revision as of 12:53, 12 August 2021
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 October 2020, there are about 3,300 active participants (on about 16,000 host computers) from 89 countries, reporting about 1,860 teraflops.[1]
Sub-projects
- Type Proth:
- 321 Prime Search searching for mega primes of the form 3•2n±1.
- 27121 Prime Search searching for primes of the forms 27•2n±1 and 121•2n±1.
- Proth Prime Search: searching for primes of the form k•2n+1.
- Proth Prime Search Extended: searching for primes of the form k•2n+1.
- Proth Mega Prime Search: searching for primes of the form k•2n+1.
- Type Sierpiński:
- Seventeen or Bust: helping to solve the Sierpiński problem.
- Extended Sierpiński Project: helping solve the Extended Sierpiński Problem.
- Prime Sierpiński Problem: helping Prime Sierpiński Project solve the Prime Sierpiński problem.
- Sierpiński base 5: helping to solve the Sierpiński-Riesel Base 5 Problem.
- Riesel base 5: helping to solve the Sierpiński-Riesel Base 5 Problem.
- Type Riesel:
- The Riesel Problem: helping to solve the Riesel problem.
- Type Fermat:
- Generalized Fermat Prime Search: searching for megaprimes of the form b2n+1.
- Fermat Divisor Search: searching for large prime divisors of Fermat numbers.
- Type Cullen/Woodall:
- Cullen Prime Search: searching for mega primes of the forms n•2n+1.
- Woodall Prime Search: searching for mega primes of the forms n•2n-1.
- Generalized Cullen Prime Search: searching for primes of the form n•bn+1.
- Others:
- AP27 Search: searching for an arithmetic progression (p+dn) that yields primes for 27 consecutive values of n.
- Sophie Germain Search: searching for primes p and 2p+1, and twin primes p and p+2.
