PrimeGrid's primary goal is to bring the excitement of prime finding to the "everyday" computer user. By simply downloading and installing BOINC and attaching to the PrimeGrid project, participants can choose from a variety of prime forms to search. With a little patience, you may find a large or even record breaking prime and enter into Chris Caldwell's The Largest Known Primes Database as a Titan!
PrimeGrid's secondary goal is to provide relevant educational materials about primes. Additionally, we wish to contribute to the field of mathematics.
Lastly, primes 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:- 321 Prime Search: searching for mega primes of the form 3·2n±1.
- Cullen-Woodall Search: searching for mega primes of forms n·2n+1 and n·2n−1.
- Prime Sierpinski Project: helping Prime Sierpinski Project solve the prime Sierpinski Problem.
- Extended Sierpinski Problem (LLR)
- 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 Problem.
- Generalized Fermat Prime Search: searching for megaprimes of the form b2n+1.
Loading Stats Data...
