OpenPFGW (a.k.a. PrimeForm)


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): c13, c23, c26, c31, c32 ... ... CH13, c97, c100, c101, CH14
Active wild codes: ^p\d+
Code prefix:p
E-mail address: (e-mail address unpublished)
Web page:
Username PrimeForm (entry created on 1/18/2000 18:50:53 UTC)
Database id:175 (entry last modified on 11/16/2023 16:29:29 UTC)
Program Does *: other, sieve, prp, special, plus, minus, classical
Active primes:on current list: 411, rank by number 8
Total primes: number ever on any list: 16934
Production score: for current list 52 (normalized: 1523), total 52.4460, rank by score 18
Largest prime: (102332974 + 1)2 - 2 ‏(‎4665949 digits) via code p405 on 2/20/2024 13:05:54 UTC
Most recent: 7 · 101454508 + 1 ‏(‎1454509 digits) via code p439 on 3/13/2024 07:14:20 UTC
Entrance Rank: mean 35133.17 (minimum 13, maximum 114971)

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 many x86 platforms, including Windows, Linux, and Mac. It uses the George Woltman libraries (gwnum), as developed for the GIMPS project, for high-speed PRP and classical testing of arbitrary forms. There are both 32-bit and 64-bit builds available. You will also find a Windows GUI version of PFGW, called WinPFGW, that can run on Windows XP, Windows Vista, and Windows 7.

OpenPFGW is an open source project. The source code is freely available and all contributions are welcome. You can find discussions on pfgw capabilities and usage. You can find discussions on pfgw releases.

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.

Surname: OpenPFGW (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 OpenPFGW (a.k.a. PrimeForm) and I would like to
Edit this page
Printed from the PrimePages <> © Reginald McLean.