Proof-code: x32

Previous Next Random

Samuel Yates began, and this site continues, a database of the largest known primes. Primes in that database are assigned a proof-code to show who should be credited with the discovery as well as what programs and projects they used. (Discoverers have one prover-entry, but may have many proof-codes because they use a variety of programs...)

This page provides data on x32, one of those codes.

Code name (*):x32   (See the descriptive data below.)
Persons (*):2 (counting humans only)
Projects (*):0 (counting projects only)
Display (HTML):Broadhurst, Renze, OpenPFGW
Number of primes:total 1
Unverified Primes:0 (prime table entries marked 'Composite','Untested', or 'InProcess'
Score for Primes (*):total 40.0432

Descriptive Data: (report abuse)
This proving code has been subjected to deep scrutiny. David Broadhurst claimed that by algebraic methods one may prove primality at 117202 decimal digits, with merely 25.12925886% factorization. John Renze has been enormously kind in examining this claim. We now endorse it jointly, acknowledging the role of PrimeForm in finding a suitable target and in performing the single Pocklington test that was needed, before our algebraic Coppersmith--Howgrave-Graham proof could be completed.
I am a member of this code and I would like to:
Edit the descriptive data above as:

Below is additional information about this entry.

Display (text):Broadhurst, Renze, OpenPFGW
Display (short):Broadhurst & Renze
Database id:1170 (do not use this database id, it is subject to change)
Proof program:unknown
Entry last modified:2024-11-21 20:37:09
Printed from the PrimePages <t5k.org> © Reginald McLean.