FastECPP as Implemented by Morain; Franke, Kleinjung and Wirth

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):	FE2, FE3, FE1, FE4, FE5, FE6, FE7, FE8, FE9
Code prefix:	FE
E-mail address:	(e-mail address unpublished)
Web page:	http://www.lix.polytechnique.fr/~morain/
Username:	FastECPP	(entry created on 09/28/04)
Database id:	689	(entry last modified on 06/04/20)
Program Does *:	general
Active primes:	on current list: 4, rank by number 30
Total primes:	number ever on any list: 24
Production score:	for current list 36 (normalized: 0), total 36.6819, rank by score 29
Largest prime:	"τ(157²²⁰⁶)" ‏(‎26643 digits) via code FE1 on 04/03/11
Most recent:	"τ(157²²⁰⁶)" ‏(‎26643 digits) via code FE1 on 04/03/11
Entrance Rank:	mean 40010.00 (minimum 37494, maximum 41352)

Descriptive Data: (report abuse)

Fast ECPP is a version of the Elliptic Curve Primality Proving Algortihm using square-root tests for many discriminants originally proposed by J. 0. Shallit [LL90].

In particular this entry is to credit the different implementations of FastECPP by François Morain [Morain2004] and the team of Franke, Kleinjung and Wirth [FKWM2004]. These teams often work together on a single prime, sharing the intermediate certificates.

Error in data above: HTML_Tidy reports: line 9 column 162 - Info: value for attribute "class" missing quote marks line 12 column 2 - Info: value for attribute "class" missing quote marks line 12 column 116 - Info: value for attribute "class" missing quote marks

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

I administer FastECPP as Implemented by Morain; Franke, Kleinjung and Wirth and I would like to