PrimeGrid
(Another of the Prime Pages' resources)
The Largest Known Primes Icon
  View this page in:   language help
 
project A titan, as defined by Samuel Yates, is anyone who has found a titanic prime. This page provides data on those that have found these primes. The data below only reflect on the primes currently on the list. (Many of the terms that are used here are explained on another page.)
User supplied image--mail editor to report abuse.

Proof-code(s):
L202, L150, L204, L205, L206 ... ... L4403, L4404, L4406, L4407, L4408
E-mail address: admin@primegrid.com
Web page:http://www.primegrid.com/
Username: PG (entry created on 01/17/2007)
Database id:950 (entry last modified on 06/25/2016)
Active primes:on current list: 3622, rank by number 1
Total primes: number ever on any list: 24142.5
Production score: for current list 53 (normalized: 17001), total 53.7804, rank by score 2
Largest prime: 3 · 211895718 - 1 ‏(‎3580969 digits) via code L4159 on 06/26/2015
Most recent: 5331 · 21411667 + 1 ‏(‎424958 digits) via code L2117 on 06/30/2016
Entrance Rank: mean 1771.75 (minimum 11, maximum 9406)

Descriptive Data: (report abuse)
PrimeGrid is a distributed computing project which utilizes BOINC and PRPNet to search for primes. PrimeGrid's primary goal is to bring the excitement of prime finding to the "everyday" computer user. Simply download the software and let your computer do the rest. 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.
BOINC - The Berkeley Open Infrastructure for Network Computing (BOINC) is a software platform for distributed computing using volunteered computer resources. It allows users to participate in multiple distributed computing projects through a single program. For more information, please visit BOINC:  http://boinc.berkeley.edu

  • 321 Prime Search: searching for megaprimes of the form 3*2n±1
  • Cullen-Woodall Search: searching for megaprimes of forms n*2n+1 and n*2n−1
  • Prime Sierpiński Project: helping to solve the prime Sierpiński Problem
  • Proth Prime Search: searching for primes of the form k*2n+1
  • Seventeen or Bust: helping to solve the Sierpiński Problem
  • Sophie Germain Prime Search: searching for primes p and 2p+1
  • The Riesel problem: helping to solve the Riesel Problem

PRPNet - PRPNet is a client/server application specifically designed to help find prime numbers of various forms. For more information, please visit PrimeGrid's PRPNet forum thread: http://www.primegrid.com/forum_thread.php?id=1215

  • 27121 Prime Search: k=27 and 121 for k*2n±1
  • Extended Sierpiński Problem: is k=271129 the second Sierpiński number
  • Factorial Prime Search: n!+1 and n!−1
  • Generalized Fermat Number Prime Search: b2n+1
  • Generalized Woodall & Cullen Prime Search: multiple bases
  • Primorial Prime Search: p#+1 and p#−1
  • Proth Prime Search Extended: k*2n+1; 1200<k<10000
  • Sophie Germain Prime Search: searching for primes p and 2p+1
For more information about PrimeGrid and a complete list of available prime search projects, please visit: http://www.primegrid.com

I administer PrimeGrid and I would like to
Edit this page
Surname: PrimeGrid (used for alphabetizing and in codes)
Unverified primes are omitted from counts and lists until verification completed.