PrimeGrid
PrimeGrid | |
---|---|
Area: | Prime number tests |
Target: | Various primality tests |
Country: | Lithuania |
Platform: | BOINC |
Website: | https://www.primegrid.com/ |
Project status | |
Status: | active |
Start: | July 2005 |
The End: | still active |
PrimeGrid is a volunteer computing project with several sub - projects that uses the technology of distributed computing to search for special prime numbers . If a prime number database was originally created, today one searches for a multitude of prime numbers in a special form.
The project was officially started in July 2005. The basis of the calculations is the BOINC software from the University of California, Berkeley .
The project found the largest known twin primes , Woodall and Cullen primes , among others .
Sub-projects
- 321 Prime Search : searches for prime numbers with more than 1,000,000 decimal places of the form .
- Cullen-Woodall Search : searches for prime numbers with more than 1,000,000 decimal places of the forms (see Cullen or Woodall number ).
- Prime Sierpinski Project : triesto solve the Prime Sierpinski problem .
- Proth Prime Search : searches for Proth prime numbers .
- Seventeen or Bust : triesto solvethe Sierpiński problem .
- Sophie Germain Prime Search : searches for Sophie Germain prime numbers .
- The trickle problem : tries to solve the trickle problem .
Former projects
- AP26 Search : searched for an arithmetic sequence with 26 prime numbers. On April 12, 2010, the first arithmetic sequence was found with 26 prime numbers at a constant distance. It reads for , where 23 # = 223092870 is the prime faculty of 23.
- Prime Generator : created a prime number database
- Twin Prime Search : searched for prime twins with more than 10,000 decimal places of the form .
Project staging area
In the Project Staging Area, sub-projects are coordinated that are not yet accessible via BOINC.
- 27121 Sieving
- Factorial Sieving
- Generalized Fermat Number Prime Sieving
- Primorial Sieving
- Proth Prime Search Extended Sieving
- PRPNet