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.)
E-mail address: (e-mail address unpublished)
(entry created on 11/22/2009)
Database id: 2058
(entry last modified on 12/11/2013)
Program Does *: sieve
Active primes: on current list: 3356,
rank by number 3
Total primes: number ever on any list: 14723
Production score: for current list 52 (normalized: 8389), total 52.6330,
rank by score 4
(1738749 digits) via code 7 · 2 5775996 + 1 L3325 on 11/10/2012
(363809 digits) via code 4453 · 2 1208534 + 1 L3727 on 12/11/2013
Entrance Rank: mean 1572.23 (minimum 24, maximum 4612)
Unprocessed: prime submissions still untested or inprocess: 2.
( report abuse)
A collection of 'fixed n' sieves capable of quickly
processing multiple integer sequences in k and n of the
form k*2^n+/-1, where k < 2^62, n < 2^31.
originally developed by Geoff
Reynolds for the Twin Prime Search, was meant for use in a
sieve with one or a few n's. It was then modified by Ken
Brazier, in collaboration with Geoff Reynolds, to make
many-n searching efficient, within the fixed-n format.
Additional modifications by Ken allowed tpsieve to sieve
for the combined forms of k*2^n+1/k*2^n-1.
developed by Ken Brazier, is a
modified version of TPSieve that sieves for single primes
of the form k*2^n+1. Its strength is the many-n
optimization. Also, with the --riesel flag, it can sieve
I administer Reynolds and Brazier's PSieve and I would like to
Surname: PSieve (used for alphabetizing and in codes)
Unverified primes are omitted from counts and lists until verification completed.