Yves Gallot's GeneFer

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):	p316, p317, p318, p319, p329 ... ... L6230, L6235, L6236, L6237, L6238
E-mail address:	(e-mail address unpublished)
Web page:	http://www.assembla.com/code/genefer/subversion/nodes
Username	GeneFer	(entry created on 2/13/2011 06:11:34 UTC)
Database id:	2740	(entry last modified on 3/29/2025 18:34:19 UTC)
Program Does *:	prp, special
Active primes:	on current list: 1681, rank by number 5
Total primes:	number ever on any list: 4711
Production score:	for current list 55 (normalized: 18361), total 55.3288, rank by score 7
Largest prime:	3843236^1048576 + 1 ‏(‎6904556 digits) via code L6094 on 12/22/2024 17:04:35 UTC
Most recent:	53616962²⁶²¹⁴⁴ + 1 ‏(‎2026191 digits) via code L4889 on 3/29/2025 00:11:17 UTC
Entrance Rank:	mean 735.34 (minimum 12, maximum 39098)
Unprocessed:	prime submissions still untested or inprocess: 10.

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.

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

I administer Yves Gallot's GeneFer and I would like to