FastECPP as Implemented by Morain; Franke, Kleinjung and Wirth
(Another of the Prime Pages' resources)
The Largest Known Primes Icon
  View this page in:   language help
 
program 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 reflect 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/2004)
Database id:689 (entry last modified on 04/06/2012)
Program Does *: general
Active primes:on current list: 6, rank by number 21
Total primes: number ever on any list: 24
Production score: for current list 36 (normalized: 0), total 36.6819, rank by score 25
Largest prime: "τ(1572206)" ‏(‎26643 digits) via code FE1 on 04/03/2011
Most recent: "τ(1572206)" ‏(‎26643 digits) via code FE1 on 04/03/2011
Entrance Rank: mean 36971.17 (minimum 22561, maximum 41352)

Descriptive Data: (report abuse)
FastECPP as Implemented by Morain; Franke, Kleinjung and Wirth

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.

I administer FastECPP as Implemented by Morain; Franke, Kleinjung and Wirth and I would like to
Edit this page
Surname: FastECPP (used for alphabetizing and in codes)
Unverified primes are omitted from counts and lists until verification completed.