# Reynolds and Brazier's PSieve

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): E-mail address: L1115, L1116, L1117, L1118, L1119 ... ... L6061, L6062, L6063, L6064, A38 (e-mail address unpublished) PSieve (entry created on 11/22/2009 21:27:18 UTC) 2058 (entry last modified on 9/5/2024 00:48:49 UTC) sieve Active primes: on current list: 2442, rank by number 3 number ever on any list: 22990 for current list 54 (normalized: 12155), total 54.7801, rank by score 12 121 · 29584444 + 1 ‏(‎2885208 digits) via code L5183 on 11/20/2020 14:02:52 UTC 93 · 25323466 + 1 ‏(‎1602525 digits) via code L5537 on 9/6/2024 00:42:21 UTC mean 956.86 (minimum 24, maximum 49657) prime submissions still untested or inprocess: 1.

Descriptive Data: (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. TPSieve: 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. PPSieve: 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 for k*2^n-1.

Surname: PSieve (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 Reynolds and Brazier's PSieve and I would like to