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 x38, one of those codes.
Code name ( *): x38 (See the descriptive data below.)
Persons ( *): 1 (counting humans only)
Projects ( *): 0 (counting projects only)
Display (HTML): Broadhurst, Primo, OpenPFGW
Number of primes: total 100
Unverified Primes: 0 (prime table entries marked 'Composite','Untested', or 'InProcess')
Score for Primes ( *): total 45.5730, on current list 33.8342
Entrance Rank ( *): mean 0.00 (minimum 0, maximum 0)
I am a member of this code and I would like to:
( report abuse)
The following methodology was used for Lehmer primitive
parts: (1) Pari-GP for cyclotomic or Aurifeuillian
factorizations of N^2-1; (2) GMP-ECM, Msieve or ggnfs for
extracting PrP factors of such cofactors; (3) Primo or
APR-CL for proving these helpers prime; (4) OpenPFGW for
BLS tests with these prime helpers; (5) Pari-GP code for
Williams--Lenstra, Konyagin--Pomerance, or
Coppersmith--Howgrave-Graham proofs, where BLS was
insufficient. For consecutive primes in arithmetic
progression and for quintuplets, sieving was done by
Pari-GP. In these cases, proving was by done Primo, for a
CPAP4, and by Pari-GP's APR-CL, for a CPAP5 or quintuplet.
For generalized unique primes, sieving was done by Pari-GP
and proving by a CHG method, implemented in Pari-GP.
Below is additional information about this entry.
Display (text): Broadhurst, Primo, OpenPFGW
Display (short): Broadhurst
Database id: 4017 (do not use this database id, it is subject to change)
Proof program: unknown
Entry last modified: 2019-05-26 16:50:14