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.)

User supplied image--mail editor to report abuse.
L202, L150, L204, L205, L206 ... ... L6033, L6034, L6035, L6036, L6037
E-mail address:
Web page:
Username PG (entry created on 1/17/2007 16:27:48 UTC)
Database id:950 (entry last modified on 5/19/2024 16:53:02 UTC)
Active primes:on current list: 3404, rank by number 1
Total primes: number ever on any list: 33459
Production score: for current list 55 (normalized: 47002), total 55.9026, rank by score 2
Largest prime: 10223 · 231172165 + 1 ‏(‎9383761 digits) via code SB12 on 11/6/2016 18:15:13 UTC
Most recent: 5639 · 21966563 + 1 ‏(‎591999 digits) via code L5596 on 5/27/2024 20:40:52 UTC
Entrance Rank: mean 706.31 (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:

  • 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:

  • 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:

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
Edit this page
Printed from the PrimePages <> © Reginald McLean.