MultiSieve/mtsieve

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):	p75, p77, p93, p95, p99 ... ... p447, p448, A43, A61, L6249
E-mail address:	rogue@wi.rr.com
Web page:	http://sourceforge.net/projects/mtsieve/
Username	MultiSieve	(entry created on 1/22/2003 19:23:50 UTC)
Database id:	449	(entry last modified on 4/27/2025 15:02:37 UTC)
Program Does *:	sieve
Active primes:	on current list: 38, rank by number 20
Total primes:	number ever on any list: 332
Production score:	for current list 53 (normalized: 3342), total 53.6288, rank by score 15
Largest prime:	4052186 · 69^4052186 + 1 ‏(‎7451366 digits) via code A61 on 4/17/2025 12:15:47 UTC
Most recent:	19861029 · 2^3070319 + 1 ‏(‎924266 digits) via code A31 on 5/26/2025 18:21:18 UTC
Entrance Rank:	mean 2995.87 (minimum 13, maximum 92712)

Descriptive Data: (report abuse)

This program is used for sieving numbers of some popular forms that are not supported in NewPGen or any of the other popular sieves. This includes but is not limited to:

afsieve/afsievecl - alternating factorials
fkbnsieve - fixed k, b, n for k*b^n+-c
fbncsieve - fixed b, n, c for k*b^n+-c
gcwsieve/gcwsievecl - Cullens/Woodalls (n*2^n+/-1) and Generalized Cullens/Woodalls (n*b^n+/-1 for b > 2), x^y+y^x
cksieve - Carol/Kynea (2^n +/- 1)^2 - 2
dmdsieve - double Mersenne divisor sieve
k1b2sieve - 2^n+c
kbbsieve - k*b^n+1/k*b^n-1
gfndsieve - GFN divisors (replaces fermfact)
mfsieve/mfsievecl - factorials (n!+/-1) and multi-factorials (n!x+/-1 for x > 1, e.g. n!5+1 = n!!!!!+1)
psieve - primorial (p# +/- 1)
pixsieve/pixsievecl - primes in x
smsieve/smsievecl - Smarandache
srsieve2/srsieve2cl - Sierpinski/Riesel sieve
twinsieve - twins
xyyxsieve/xyyxsievecl - x^y + y^x

MultiSieve is no longer supported. It has been replaced by the mtsieve framework. The documentation can be found here: http://www.mersenneforum.org/rogue/mtsieve.html. The framework can be compiled on Windows (using msys2), OS X, and Linux. Only x86 is supported at this time.

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

I administer MultiSieve/mtsieve and I would like to