Proof-code: x1
(Another of the Prime Pages' resources)
The Largest Known Primes Icon
  View this page in:   language help
  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 x1, one of those codes.

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

I am a member of this code and I would like to:
Submit primes using this code as: (A password will be required before submission is completed.)
Edit descriptive data (below) as:

Descriptive Data: (report abuse)
This proof was achieved with specially written Pari-GP code that implements an extension of the Konyagin-Pomerance method to include factors of both N-1 and N+1. Massive use was made of ECM. Primeform did the BLS tests, which were necessary but _not_ sufficient. Primo proved the large factors of N^2-1. Andy Steward wrote VBA code to check the Pari-GP cubics.
Below is additional information about this entry.
Display (text):Steward, Water, Broadhurst, Primo, OpenPFGW
Display (short):Steward, Water & Broadhurst
Database id:279 (do not use this database id, it is subject to change)
Proof program:unknown
Entry last modified:2017-12-15 15:50:14