PrimeGrid
Please visit donation page to help the project cover running costs for this month

Join PrimeGrid

  1. Read our rules and policies.
  2. Download, install and run the BOINC software used by PrimeGrid.
  3. When prompted, enter the URL:
    http://www.primegrid.com/

Returning Participants

Community

Leader Boards

Other

drummers-lowrise
Available: 321 Prime Search (LLR) 93 User/Host Count 47988/152691
3.18 hosts per user
PrimeGrid's 2012 Challenge Series
The Leap Day Challenge
29 February 18:00 UTC – 1 March 18:00 UTC



2012 Tour de Primes
1 February 00:00 UTC – 1 March 00:00 UTC
2012 Yellow 2012 green 2012 polkadot
Stats

Year of the Dragon Standings
Participants | Teams
Available: Cullen Prime Search (LLR) 92
Available: Prime Sierpinski Problem (LLR) 95 Tasks in Progress 189913
Available: Proth Prime Search (LLR) 4604 UTC time 2012-02-04 16:57:47
Available: Seventeen or Bust (LLR) 87 Powered by BOINC
Available: Sophie Germain Prime Search (LLR) 5991
Available: The Riesel Problem (LLR) 982
Available: Woodall Prime Search (LLR) 151
Available: Cullen/Woodall (Sieve) 109523
Available: Proth Prime Search (Sieve) 187712
Available: The Riesel Problem (Sieve) 2720
Available: Generalized Fermat Prime Search beta 9718

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.
  • 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.
  • Seventeen or Bust: helping to solve the Sierpinski Problem.
  • Sophie Germain Prime Search: searching for primes p and 2p+1.
  • The Riesel problem: helping to solve the Riesel Problem.
   You can choose the projects you would like to run by going to the project preferences page.

Recent Significant Primes

On 4 Jan 2012 0:34:57 UTC, PrimeGrid's Proth Prime Search project found a prime Fermat divisor:
329*2^1246017+1 Divides F(1246013)
The prime is 375,092 digits long and enters Chris Caldwell's The Largest Known Primes Database ranked 6th for prime Fermat divisors and 522nd. It is the 1st divisor found in 2012 and 293rd overall. The discovery was made by Bruce Dodson (bdodson*) of United States using an Intel Xeon MP @ 2.80GHz with 12 GB RAM running Linux. This computer took just over 3 hours and 25 minutes to complete the primality test using LLR. Bruce is a member of the Sicituradastra. team. For more information, please see the Official announcement.


On 25 Dec 2011 13:31:28 UTC, PrimeGrid's Sophie Germain Prime Search found World Record Twin Primes:
3756801695685*2^666669±1
The twin primes are 200,700 digits long, eclipsing the previous record of 100,355 digits. They will enter Chris Caldwell's The Largest Known Primes Database ranked 1st for Twins.

The discovery was made by Timothy D. Winslow (Pooh Bear 27) of the United States using an Intel Core i7 920 @ 2.67GHz with 8 GB RAM running Windows 7 Ultimate. This computer, using LLR, took 9 minutes and 21 seconds to complete the primality tests of both primes. Timothy is a member of the The Knights Who Say Ni! team. For more information, please see the Official announcement.


Other significant primes


43142746595714191+23681770*23#*n for n=0..25 (AP26): official announcement
6679881·26679881+1 (Cullen): official announcement | decimal representation
6328548·26328548+1 (Cullen): official announcement | decimal representation
110059!+1 (Factorial): official announcement
103040!-1 (Factorial): official announcement
94550!-1 (Factorial): official announcement
75898524288+1 (GFN): official announcement | Generalized Fermat Prime
361658262144+1 (GFN): official announcement | Generalized Fermat Prime
145310262144+1 (GFN): official announcement | Generalized Fermat Prime
40734262144+1 (GFN): official announcement | Generalized Fermat Prime
563528·13563528-1 (GW): official announcement | Generalized Woodall
404882·43404882-1 (GW): official announcement | Generalized Woodall
843301#-1 (Primorial): official announcement
9·22543551+1 (PPS): official announcement | Fermat Divisor
25·22141884+1 (PPS): official announcement | Fermat Divisor
4479·2226618+1 (PPS): official announcement | Fermat Divisor
3771·2221676+1 (PPS): official announcement | Fermat Divisor
7333·2138560+1 (PPS): official announcement | Fermat Divisor
519·2567233+1 (PPS): official announcement | Fermat Divisor
651·2476624+1 (PPS): official announcement | Fermat Divisor
353159·24331116-1 (TRP): official announcement
141941·24299438-1 (TRP): official announcement
415267·23771929-1 (TRP): official announcement
123547·23804809-1 (TRP): official announcement
65531·23629342-1 (TRP): official announcement
191249·23417696-1 (TRP): official announcement
428639·23506452-1 (TRP): official announcement
65516468355·2333333±1 (Twin): official announcement | twin +1; twin -1
3752948·23752948-1 (Woodall): official announcement | decimal representation
2367906·22367906-1 (Woodall): official announcement | decimal representation
2013992·22013992-1 (Woodall): official announcement | decimal representation

Newly reported primes

31171683729375*2^666666-1 (George Eldridge); 31200541499085*2^666666-1 (orita); 31199539751835*2^666666-1 (TLC); 31176390851595*2^666666-1 (nanohana@jisaku); 1185*2^1478556+1 ([DPC] Gilly); 847*2^1477272+1 (martynbamber); 15767561311425*2^666667-1 (George Eldridge); 31083524589855*2^666666-1 (zablociak); 705*2^1478286+1 (Lennart SM5YMT); 162941*2^993718-1 (unconnected); 163*2^1475932+1 (KevinH); 127*2^1472718+1 (vtl); 983562712275*2^666671-1 (kc8ytf); 983562712275*2^666671-1 (Dimond); 31049200245705*2^666666-1 (Filter); 647*2^1461075+1 (chip); 133*2^1471408+1 (nutcase); 207*2^1471290+1 (s-yama); 855*2^1449637+1 (Zeppelin); 303*2^1470065+1 (Nosferatu*)

Last 24 hours

Top participants by work done in the last 24 hours

STE\/E5831830
bapu5400342
james ying3815366.18
xdrv3411907.08
IshtarIS3170676.34
ThrasherX-173135030
KAON*2959738
Carat@voice2878834
orita2580281.54
[boinc.at] Fireman692382932.41

Top teams by work done in the last 24 hours

Sicituradastra.19182103.13
SETI.Germany18205654.5
SETI.USA11271270.16
L'Alliance Francophone9445722.34
Team 2ch8327143.95
Polish National Team7461257.31
Team China6455030.63
BOINCstats6086684.2
Czech National Team5337345.16
BOINC.Italy5186382.81

News RSS feed

Call for arms: full doublecheck of TRP
We have recently started a limited doublecheck effort for The Riesel Problem and this has very quickly yielded a prime, which means that the results that we obtained from Riesel Sieve project cannot be trusted 100%. Therefore we have decided to run a full doublecheck effort.

We would like to quickly go through the doublecheck ranges and resume our original search, so we would like to ask you to consider redirecting any resources you may have available to The Riesel Problem (TRP) subproject. You can do that by visiting project preferences page.

Applications are available for Windows, Linux and Mac. 32bit applications will be sent to 64bit hosts.
3 Feb 2012 | 12:22:23 UTC · Comment


Prime found for the Riesel Problem
On 2 Feb 2012, 21:30:55 UTC, PrimeGrid’s The Riesel Problem project eliminated k=162941 by finding the prime: 162941*2^993718-1

The prime is 299,145 digits long and will enter Chris Caldwell's The Largest Known Primes Database ranked 1536th overall. This prime was found while exploring a suspected gap in a previously searched range. This is PrimeGrid's 8th elimination. 56 k's now remain.

The discovery was made by Dmitry Domanov (unconnected) of Russia using an Intel Xeon @ 3.60GHz with 2 GB RAM running Windows Server 2003 Enterprise x86. This computer took just over 1 hour 5 minutes to complete the primality test using LLR. Dmitry is a member of Team Russia.

For more details, please see the official announcement.
3 Feb 2012 | 5:02:47 UTC · Comment


The Tour de Primes Begins!
Come join us in laid-back competition in tribute to the number 2...the first prime and the only even prime. The prizes are simple colored jerseys . Yellow for the most primes, Green for the highest prime score, and Polk-a-dot for the most primes on 19 Feb. No pressure or stress other than what you put on yourself. :) For more information, please see Tour de Primes 2012. 1 Feb 2012 | 0:29:32 UTC · Comment


World Record Generalized Cullen Prime
On 29 Jan 2012, 08:10:03 UTC, PrimeGrid’s PRPNet found the largest known generalized Cullen prime: 427194*113^427194+1

The prime is 877,069 digits long and enters Chris Caldwell's The Largest Known Primes Database ranked 1st for generalized Cullen primes and 57th overall.

The discovery was made by Ricky L. Hubbard of the United States using an AMD Phenom II X6 1090t @ 3.2GHz with 8GB RAM, running Windows 7. This computer took 7 hours and 15 minutes to complete the probable prime test using pfgw64 and 7 hours 20 minutes to complete the primality test again using pfgw64. Ricky is a member of the AMD Users Team.

For more details, please see the official announcement.
30 Jan 2012 | 2:12:11 UTC · Comment


Tour de Primes 2012
February is just a week away which means it is time for the 4th annual Tour de Primes. 2 is the first prime number...and the only even one. Therefore, we have declared February, the 2nd month, as prime month.

We're offering a small informal competition in tribute to this unique prime number. There are no points to be gained or awards to be won...just a simple rare jersey (Yellow, Green, and Polk-a-dot) at the end of the month to add to your badge collection. No pressure or stress other than what you put on yourself. :) For more information, please see Tour de Primes 2012.
24 Jan 2012 | 16:23:12 UTC · Comment


... more

News is available as an RSS feed   RSS

[Return to PrimeGrid main page]
Copyright © 2005 - 2012 Rytis Slatkevičius (contact) and PrimeGrid community. Server load 8.83, 4.57, 3.75
Generated 4 Feb 2012 | 16:57:47 UTC