Yves Gallot's GeneFer
(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):
p316, p317, p318, p319, p329 ... ... L4697, L4701, L4702, L4704, L4705
E-mail address: (e-mail address unpublished)
Web page:http://www.assembla.com/code/genefer/subversion/nodes
Username: GeneFer (entry created on 02/13/2011)
Database id:2740 (entry last modified on 12/03/2017)
Program Does *: prp, special
Active primes:on current list: 343, rank by number 7
Total primes: number ever on any list: 371
Production score: for current list 52 (normalized: 7229), total 52.6455, rank by score 9
Largest prime: 9194441048576 + 1 ‏(‎6253210 digits) via code L4286 on 09/02/2017
Most recent: 2744153465536 + 1 ‏(‎487484 digits) via code L4649 on 12/09/2017
Entrance Rank: mean 1457.86 (minimum 12, maximum 2210)

Descriptive Data: (report abuse)

Genefer is a suite of programs for performing Probable Primality tests of (and as of 2016, primality proofs for) Generalized Fermat numbers. Highly optimised implementations of a specific transform are available for x86 CPU and for GPU supporting OpenCL.

Genefer has been extensively used by PrimeGrid computing project.

Genefer was originally developed by Yves Gallot in 2001 and was further improved by David Underbakke and Mark Rodenkirch.

The current version includes contributions from a number of developers, and has been open-source since 2011. Genefer is released under the MIT license.

I administer Yves Gallot's GeneFer and I would like to
Edit this page
Surname: GeneFer (used for alphabetizing and in codes)
Unverified primes are omitted from counts and lists until verification completed.