Prime Numbers are of great interest to mathematicians for a variety of reasons. Primes also play a central role in the cryptographic systems which are used for computer security. Through the study of Prime Numbers it can be shown how much processing is required to crack an encryption code and thus to determine whether current security schemes are sufficiently secure.
PrimeGrid is currently running several sub-projects:
Twin Prime Search: searching for gigantic twin primes of the form k*2n + 1 and k*2n - 1. Cullen-Woodall Search: searching for mega primes of forms n*2n + 1 and n*2n - 1. 3*2^n-1 Search: searching for mega primes of the form 3*2n - 1. Prime Sierpinski Project: helping Prime Sierpinski Project solve the Prime Sierpinski Problem.
You can choose the projects you would like to run.
{{{Project}}}
{{{Digits}}}
{{{Status}}}
{{{Info}}}
Future Projects (planned)
+1 Prime Search
Generalized Cullen/Woodall Search
Hyper Cullen/Woodall
Generalized Fermat Prime Search
Wieferich prime
Octoproth Search
Riesel and Sierpinski conjectures
Twin prime search (higher digits), Twin Prime was found
Sophie Germain Prime Search (LLR) 5.11 Woodall Prime Search (LLR) 5.11 Cullen Prime Search (LLR) 5.11 Cullen/Woodall Prime Search (Sieve) 1.01 Prime Sierpinski Problem (Sieve) 1.12 321 Prime Search (LLR) 5.13 Prime Sierpinski Problem (LLR) 5.11 Proth Prime Search (Sieve) 1.38 PPS LLR 5.11 321 Prime Search (Sieve) 1.13 Seventeen or Bust 1.12 The Riesel Problem (LLR) 5.11
Linux
Sophie Germain Prime Search (LLR) 6.09 Woodall Prime Search (LLR) 6.09 Cullen Prime Search (LLR) 6.09 Cullen/Woodall Prime Search (Sieve) 1.12 Prime Sierpinski Problem (Sieve) 1.02 321 Prime Search (LLR) 6.09 Prime Sierpinski Problem (LLR) 6.09 Proth Prime Search (Sieve) 1.38 PPS LLR 6.09 321 Prime Search (Sieve) 1.02 Seventeen or Bust 1.02 The Riesel Problem (LLR) 6.09
Mac
Sophie Germain Prime Search (LLR) 6.09 Woodall Prime Search (LLR) 6.09 Cullen Prime Search (LLR) 6.09 Cullen/Woodall Prime Search (Sieve) 1.12 Prime Sierpinski Problem (Sieve) 1.02 321 Prime Search (LLR) 6.09 Prime Sierpinski Problem (LLR) 6.09 Proth Prime Search (Sieve) 1.38 PPS LLR 6.09 321 Prime Search (Sieve) 1.02 Seventeen or Bust 1.02 The Riesel Problem (LLR) 6.09
64bit
Cullen/Woodall Prime Search (Sieve) 1.12 Prime Sierpinski Problem (Sieve) 1.02 Proth Prime Search (Sieve) 1.38 321 Prime Search (Sieve) 1.13/1.07/1.02 Seventeen or Bust 1.12/1.07/1.02
PS3
ATI
Proth Prime Search (Sieve) 1.38
CUDA
Cullen/Woodall Prime Search (Sieve) 1.12 Proth Prime Search (Sieve) 1.38
7 days (GCW Sieve)
12 days (Cullen)
12 days (Woodall)
12 days (3*2^n-1)
7 days (PSP Sieve)
12 days (PSP llr)
7 days (PPS Sieve)
7 days (AP26 Search)
4 days (Sophie Germain LLR)
7 days (321 Sieve)
20 days (SOB)
7 days (Riesel Sieve)
5 days (Riesel LLR)
