OpenPFGW (a.k.a. PrimeForm)
(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.)
User supplied image--mail editor to report abuse.

Proof-code(s): c13, c23, c26, c31, c32 ... ... L637, c48, x38, x39, x40
Active wild codes: ^p\d+
Code prefix:p
E-mail address: (e-mail address unpublished)
Web page:http://groups.yahoo.com/group/primeform/
Username: PrimeForm (entry created on 01/18/2000)
Database id:175 (entry last modified on 09/01/2009)
Program Does *: other, sieve, prp, special, plus, minus, classical
Active primes:on current list: 770, rank by number 4
Total primes: number ever on any list: 7938
Production score: for current list 48 (normalized: 2856), total 48.8982, rank by score 12
Largest prime: 7 · 23511774+1 ‏(‎1057151 digits) via code p236 on 11/14/2008
Most recent: 665127 · 2665128-1 ‏(‎200230 digits) via code p260 on 02/09/2010
Entrance Rank: mean 9822.68 (minimum 15, maximum 78842)

Descriptive Data: (report abuse)

"PrimeForm" (the former name of this program) allows probable prime tests of arbitrary expressions, and deterministic classical tests wherever possible. The current version, PrimeForm/GW, is available here for x86 platforms. It uses the George Woltman libraries, as developed for the GIMPS project, for high-speed PRP and classical testing of arbitrary forms.

pfgw is an open source project. All source code is freely available and all contributions are welcome.

The previous version of the program, "PrimeForm for Windows", is now obsolete. It is a sister program to Yves Gallot's proth.exe and uses the same mathematics libraries as proth.exe. It is still available for users who prefer a GUI, but it is several times slower than pfgw.

Many thanks to George Woltman and Yves Gallot for providing their wonderful mathematics libraries for the respective program versions. Thanks to Chris Caldwell and Preda Mihailescu for optimizations of the classical tests, thanks also go to Chris for supporting the p?? prover codes in the top 5000 database. Above all, thanks and appreciation go to the numerous mathematicians and computer scientists whose methods are used by the program.

I administer OpenPFGW (a.k.a. PrimeForm) and I would like to
Edit this page
Surname: OpenPFGW (used for alphabetizing and in codes)
Unverified primes are omitted from counts and lists until verification completed.