Yves Gallot's Proth.exe

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):	SP, DS, MC, L61, p150 ... ... SB10, L446, SB11, L647, p358
Active wild codes:	^g.*,^GF\d+,^GC\d+
Code prefix:	g
E-mail address:	(e-mail address unpublished)
Web page:	http://t5k.org/programs/gallot/index.html
Username	Proth.exe	(entry created on 0/0/0000 00:00:00 UTC)
Database id:	411	(entry last modified on 4/30/2016 05:50:23 UTC)
Program Does *:	other, special, plus, minus, classical
Active primes:	on current list: 55, rank by number 16
Total primes:	number ever on any list: 26811
Production score:	for current list 51 (normalized: 573), total 51.5740, rank by score 20
Largest prime:	19249 · 2^13018586 + 1 ‏(‎3918990 digits) via code SB10 on 5/7/2007 20:11:25 UTC
Most recent:	6283011 · 2^1669564 + 1 ‏(‎502596 digits) via code g430 on 5/3/2019 09:50:25 UTC
Entrance Rank:	mean 132.85 (minimum 4, maximum 1452)

Descriptive Data: (report abuse)

In 1997, the "Proth program" Proth.exe was created by Yves Gallot for the search for large prime factors of Fermat numbers and implemented the following theorem:

Proth's Theorem (1878):

Let N = k*2ⁿ + 1 with k < 2ⁿ. If there is an integer a such that a^(N-1)/2 = -1 (mod N), then N is prime.

Now, the "Proth program" has been expanded to cover the primality test of all numbers N of the form k*bⁿ + 1 or k*bⁿ - 1.

It is designed to allow test of any number of these forms and the largest of them, which can be tested on modern computers, have more than 10,000,000 digits! Then in practice, the difficulty of the test is quickly multiplying the large numbers involved. Proth is highly optimized for the test of large numbers (more than 10,000 digits). Discrete Weighted Transform and Fast Fourier Transform multiplication is used for squaring or multiplying, plus fast modular operations (using the special form of N) are also employed for speed purposes.

Proth.exe has been used to find the most primes (of any program) on the list of Largest Known Primes. It has also been used to find most of the largest known non-Mersenne primes.

Surname: Proth.exe (used for alphabetizing and in codes).
Note that the prime search page will not display more than 16,000 primes.
Unverified primes are omitted from counts and lists until verification completed.

I administer Yves Gallot's Proth.exe and I would like to