# 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): Active wild codes: SP, DS, MC, L61, p150 ... ... SB10, L446, SB11, L647, p358 ^g.*,^GF\d+,^GC\d+ g (e-mail address unpublished) http://primes.utm.edu/programs/gallot/index.html Proth.exe (entry created on 11/30/99) 411 (entry last modified on 04/30/16) other, special, plus, minus, classical Active primes: on current list: 77, rank by number 11 number ever on any list: 26811 for current list 51 (normalized: 1178), total 51.5740, rank by score 17 282589933 - 1 ‏(‎24862048 digits) via code G16 on 12/21/18 6283011 · 21669564 + 1 ‏(‎502596 digits) via code g430 on 05/03/19 mean 184.67 (minimum 1, maximum 2469)

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*2n + 1 with k < 2n. 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*bn + 1 or k*bn - 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)
Unverified primes are omitted from counts and lists until verification completed.
I administer Yves Gallot's Proth.exe and I would like to