Karsten Bonath

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):	L120, L195, L421, L536, L550, p247, L1830, L4881, p403
E-mail address:	(e-mail address unpublished)
Web page:	http://www.rieselprime.de/default.htm
Username:	Bonath	(entry created on 04/28/05)
Database id:	756	(entry last modified on 03/01/19)
Active primes:	on current list: 9 (unweighted total: 9), rank by number 108
Total primes:	number ever on any list: 156 (unweighted total: 156)
Production score:	for current list 47 (normalized: 14), total 47.9241, rank by score 332
Largest prime:	(362¹³³⁶⁴⁷ + 1)² - 2 ‏(‎683928 digits) via code p403 on 06/17/19
Most recent:	(968⁷⁹⁵¹² - 1)² - 2 ‏(‎474826 digits) via code p403 on 01/13/21
Entrance Rank:	mean 1419.33 (minimum 171, maximum 3558)

Descriptive Data: (report abuse)

My intention is to collect and display all known Riesel-Primes of the form k*2^n-1 and some related information on one page!
I'm collecting since 2007 and got information for about 8000 k-values with 160,000 primes and 3500 twins so far.
Related pages for the Riesel-Problem, (Near-)Woodall-Primes or the Liskovets-Gallot conjecture are also available; furthermore many details about Prime-Search-Projects like NPLB or RPS and their current search ranges and found primes are available, too.
I'm updating almost every day this constantly increasing Database.

Nov.2010:
I've included lists of Proth primes k*2^n+1 for k<10000 and Status pages (reservations/completions) for k<1200.
Not yet all data available (like primes for k>10000 or older status listings) are shown yet, this will follow the next months.
Jan.2019:
A new Wiki for prime searching projects and related topics can be found here.

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

I am Karsten Bonath and I would like to

(Reuse an old code if your are using the same programs, projects... Only create a new code if you are doing something differently than in the past. Duplicate codes will be merged.)