Phil Carmody's 'K' sieves

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):	L19, p106, L33, p91, SB6 ... ... p372, p374, p377, CH8, SB12
E-mail address:	(e-mail address unpublished)
Username	Ksieve	(entry created on 7/22/2003 19:17:49 UTC)
Database id:	521	(entry last modified on 5/11/2021 03:58:10 UTC)
Program Does *:	sieve
Active primes:	on current list: 7, rank by number 27
Total primes:	number ever on any list: 665
Production score:	for current list 53 (normalized: 5571), total 53.6090, rank by score 15
Largest prime:	10223 · 2^31172165 + 1 ‏(‎9383761 digits) via code SB12 on 11/6/2016 18:15:13 UTC
Most recent:	10223 · 2^31172165 + 1 ‏(‎9383761 digits) via code SB12 on 11/6/2016 18:15:13 UTC
Entrance Rank:	mean 6.57 (minimum 4, maximum 10)

Descriptive Data: (report abuse)

This is a suite of "fixed k" sieves designed to be portable over many architectures (x86, Alpha, PPC, HPPA, Sparc, Power, etc.) and operating systems (Windows, linux, *BSD (inc. OSX), HPUX, Solaris, AIX, etc.).
It incorporates:
'ksieve2', which can sieve many k values in parallel;
'NbeGone', a sieve for the Seventeen or Bust project,
'dlog', for Cunningham-project style factorisation tasks,
'ck' for (generalised) Carol/Kynea forms
'abc10' for 10^a±b·10^c±1 (includes near-repdigit forms and "just 1 and 0" forms)
(Note - for fixed-k sieving a single small k value on x86 (P4 in particular) machines running windows, Paul Jobling's NewPgen should be faster. Also investigate Mark Rodenkirch's 'multisieve' for some of the other forms, as his asm may be faster than my C.)

Surname: Ksieve (used for alphabetizing and in codes).
Unverified primes are omitted from counts and lists until verification completed.

I administer Phil Carmody's 'K' sieves and I would like to