The Prime Pages: Reynolds and Brazier's PSieve

Reynolds and Brazier's PSieve
(Another of the Prime Pages' resources)

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

Proof-code(s):	L1115, L1116, L1117, L1118, L1119 ... ... L4847, L4850, L4851, L4852, L4854
E-mail address:	(e-mail address unpublished)
Username:	PSieve	(entry created on 11/22/2009)
Database id:	2058	(entry last modified on 11/11/2018)
Program Does *:	sieve
Active primes:	on current list: 3456, rank by number 3
Total primes:	number ever on any list: 18893
Production score:	for current list 53 (normalized: 12118), total 53.6553, rank by score 10
Largest prime:	3343 · 2^7166019 - 1 ‏(‎2157191 digits) via code L1884 on 09/29/2016
Most recent:	8385 · 2^1505203 + 1 ‏(‎453116 digits) via code L4854 on 11/11/2018
Entrance Rank:	mean 1315.85 (minimum 24, maximum 44548)

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.

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.