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.)
( report abuse)
GeneferCUDA is a derived work based upon algorithms by Yves
Gallot. It is a command line program for testing
Generalized Fermat primes (b^2^n+1). It is designed to
utilize CUDA. Double precision GPU required, so compute
capability 1.3 or higher, meaning a GForce GTX 260 or
better. See the web page for additional details.
For details on the original algorithm, see Yves Gallot's
genefer.c program which can be found at
David Underbakke and Mark Rodenkirch assisted with many of
the new features such as the checkpoint file, quick
calculate mode, progress reporting, and residual
Ken Brazier assisted developed CUDA version.
Iain Bethune assisted developed Mac and Linux version.
Michael Goetz developed BOINC and CUDA version.
Ronald Schneider developed Linux version.
Note: This program identifies probable primes. The probable
prime must be proven with another program before being
I administer Shoichiro Yamada's geneferCUDA and I would like to
Surname: GeneferCUDA (used for alphabetizing and in codes)
Unverified primes are omitted from counts and lists until verification completed.