PrimeGrid

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 reflects on the primes currently on the list. (Many of the terms that are used here are explained on another page.)

Proof-code(s):	L202, L150, L204, L205, L206 ... ... L6112, L6113, L6114, L6115, L6116
E-mail address:	admin@primegrid.com
Web page:	http://www.primegrid.com/
Username	PG	(entry created on 1/17/2007 16:27:48 UTC)
Database id:	950	(entry last modified on 1/19/2025 02:38:19 UTC)
Active primes:	on current list: 3456.5, rank by number 1
Total primes:	number ever on any list: 34052
Production score:	for current list 55 (normalized: 44876), total 56.0534, rank by score 2
Largest prime:	10223 · 2^31172165 + 1 ‏(‎9383761 digits) via code SB12 on 11/6/2016 18:15:13 UTC
Most recent:	8979 · 2^2099382 + 1 ‏(‎631981 digits) via code L6104 on 1/19/2025 04:24:14 UTC
Entrance Rank:	mean 695.86 (minimum 7, maximum 9706)

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*2ⁿ±1
Cullen-Woodall Search: searching for megaprimes of forms n*2ⁿ+1 and n*2ⁿ−1
Prime Sierpiński Project: helping to solve the prime Sierpiński Problem
Proth Prime Search: searching for primes of the form k*2ⁿ+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*2ⁿ±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: b^2ⁿ+1
Generalized Woodall & Cullen Prime Search: multiple bases
Primorial Prime Search: p#+1 and p#−1
Proth Prime Search Extended: k*2ⁿ+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

Surname: PrimeGrid (used for alphabetizing and in codes).
Note that the prime search page will not display more than 16,000 primes.
Unverified primes are omitted from counts and lists until verification completed.

I administer PrimeGrid and I would like to