About
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.
- AP26 Search: searching for an Arithmetic Progression of 26 primes.
- 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.
- Proth Prime Search: searching for primes of the form k·2n+1.
- Sophie Germain Prime Search: searching for primes p and 2p+1.
- Seventeen or Bust: helping to solve the
Sierpinski Problem.
- Twin Prime Search: searching for
gigantic
twin primes of the form k·2n+1 and
k·2n−1.
Recent Significant Primes
On 07 Dec 2009, 08:32:59 UTC, PrimeGrid's PRPNet found the largest known generalized Woodall prime:
563528·13563528-1
The discovery was made by Lennart Vogel of Sweden using an Intel Q6600 @ 2.4GHz with 4 GB RAM running Linux. For more details, please see the official
announcement. Other significant primes
Newly reported primes619806997365*2^666669-1 (m4rtyn); 643*2^782318+1 (s-yama); 1001*2^782313+1 (dlouwe); 639*2^782159+1 (s-yama); 3729*2^492667+1 (Robert Scullin); 165*2^781224+1 (Ossi Mauno); 3675*2^492591+1 (Anders); 6445*2^492556+1 (MSc); 9429*2^492530+1 (shanky); 763*2^737752+1 (tomakey); 557339392725*2^666669-1 (Honza); 291794611365*2^666670-1 (Spider-Bob); 295967927325*2^666670-1 (Tamagoch); 1115*2^726077+1 ([XTBA>TSA] chili69); 296615942265*2^666670-1 (Tamagoch); 8085*2^492193+1 (lunarcom); 951*2^781285+1 ([AF>HFR>RR]bcoz); 1803*2^492273+1 ([AF>HFR>RR]bcoz); 4373*2^492253+1 (lunarcom); 5527*2^492230+1 (HAmsty) Last 24 hoursTop members by work done in the last 24 hours | Top teams by work done in the last 24 hours |
|
PrimeGrid User of the Day
  Ralf ReckerIt's just me, 4 cores and 192 shaders sieving for factors and searching prime numbers and their arithmetic progressions.
News 
The Ides of March Challenge
2010-03-09 14:15 UTC
Less than one week till it's the end for some prime wannabe's. A 24 hour (15-16 March) Challenge is being offered on PrimeGrid's Prime Sierpinski Project/Seventeen or Bust (Sieve) application. Come join us as we quicken the demise for some unlucky k/n pairs.
Application builds are available for MacIntel, Linux, and Windows – with a 64 bit advantage. For more information, please see this forum post.
Tour de Primes 2010 has ended!!!
2010-03-01 21:35 UTC
A very productive month for the Tour de Primes. 309 "Top 5000" primes were discovered, easily surpassing last year's mark of 212. lennart SM5YMT of Sweden and the PrimeSearchTeam once again topped the leader boards winning his second yellow jersey in a row. He also picked up the green jersey for the first time. [SG]marodeur6 of Germany and team SETI.Germany takes home the checkered jersey.
For more details about the tour and complete standings, please see this forum post.
BEWARE the Ides of March!!!
2010-03-01 20:40 UTC
PrimeGrid's Challenge series continues with the Ides of March Challenge. Once again we observe Caesar's demise by finding factors that will bring some k/n pairs to their demise. A 24 hour (15-16 March) Challenge is being offered on PrimeGrid's Prime Sierpinski Project/Seventeen or Bust (Sieve) application.
For more information, please see this forum post.
New AP25 Found
2010-02-25 13:00 UTC
A new AP25 (Arithmetic Progression of 25 primes) has been found. It is the 13th discovered. The finder is Keith Pattenden (KWSN - Sir Brian - err sorry - wrong film!) of the United Kingdom. He is a member of the The Knights Who Say Ni! team.
The AP25 progression is written as 42592855872841649+19093314*23#*n for n=0..24. It was found by an NVIDIA GeForce GTX 260 in an Intel Core2 Quad 6600 @ 2.40GHz running 32 bit Windows XP Professional. For more details on this find and the AP26 search, please see this forum post.
New AP25 Found
2010-02-24 19:30 UTC
A new AP25 (Arithmetic Progression of 25 primes) has been found. It is the 12th discovered. The finder is Bryan Little (mfl0p) of the United States. He is a member of the [H]ard|OC team.
The AP25 progression is written as 58555890166091939+10416756*23#*n for n=0..24. It was found by an NVIDIA GeForce GTX 260 in an Intel Core2 Quad @ 2.40GHz running Linux. For more details on this find and the AP26 search, please see this forum post.
|
