Mark Rodenkirch's MultiSieve.exe

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 ... ... L4972, L5116, L5340, L5402, p425
E-mail address:	rogue@wi.rr.com
Web page:	http://sourceforge.net/projects/mtsieve/
Username	MultiSieve	(entry created on 1/22/2003 13:23:50 CDT)
Database id:	449	(entry last modified on 6/3/2022 23:38:46 CDT)
Program Does *:	sieve
Active primes:	on current list: 39, rank by number 18
Total primes:	number ever on any list: 290
Production score:	for current list 52 (normalized: 3187), total 52.7052, rank by score 14
Largest prime:	8508301 · 2^17016603 - 1 ‏(‎5122515 digits) via code L4784 on 3/22/2018 05:20:51 CDT
Most recent:	422429! + 1 ‏(‎2193027 digits) via code p425 on 2/21/2022 11:53:42 CDT
Entrance Rank:	mean 3415.13 (minimum 13, maximum 53674)

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.

Error in data above: HTML_Tidy reports: line 9 column 1 - Info: missing optional end tag </li> line 10 column 1 - Info: missing optional end tag </li> line 11 column 1 - Info: missing optional end tag </li> line 12 column 1 - Info: missing optional end tag </li> line 13 column 1 - Info: missing optional end tag </li> line 14 column 1 - Info: missing optional end tag </li> line 15 column 1 - Info: missing optional end tag </li> line 16 column 1 - Info: missing optional end tag </li> line 17 column 1 - Info: missing optional end tag </li> line 18 column 1 - Info: missing optional end tag </li> line 19 column 1 - Info: missing optional end tag </li> line 20 column 1 - Info: missing optional end tag </li> line 21 column 1 - Info: missing optional end tag </li> line 22 column 1 - Info: missing optional end tag </li> line 23 column 1 - Info: missing optional end tag </li>

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

I administer Mark Rodenkirch's MultiSieve.exe and I would like to