PrimeGrid

PrimeGrid is a project with several sub- projects, which investigated using the technique of distributed computing for special primes. Was originally a prime number database created, we examined today by a variety of primes of special form.

The project was officially launched in July 2005. The basis of the calculations is the BOINC software from the University of California, Berkeley.

The project was, among other things, the largest known twin primes, Woodall and Cullenprimzahlen.

Subprojects

  • 321 Prime Search: searching for primes with more than one million decimals of the form.
  • Cullen - Woodall Search: searching for primes with more than one million decimal places of the forms (see Cullen or Woodall number).
  • Prime Sierpinski Project: tries to solve the prime Sierpiński problem.
  • Proth Prime Search: searching for Prothschen primes.
  • Seventeen or Bust: tries to solve the Sierpiński problem.
  • Sophie Germain Prime Search: searching for Sophie Germain primes.
  • The Riesel problem: trying to solve the Riesel problem.

Former projects

  • AP26 Search: looking for an arithmetic sequence with 26 primes. The first 26 primes in arithmetic progression was found at a constant distance on April 12, 2010. She writes itself 43142746595714191 23681770 * 23 # * n for n = 0 .25 ..
  • Prime Generator: created a prime number database
  • Twin Prime Search: searching for twin primes with more than 10,000 decimal places of the mold.

Project Staging Area

In the Project Staging Area sub-projects are coordinated through the BOINC are not yet addressed.

  • 27121 Sieving
  • Factorial Sieving
  • Generalized Fermat Number Prime Sieving
  • Primorial Sieving
  • Proth Prime Search Extended Sieving
  • PRPNet
Cullen number
661011
de