Proof-code: CH12

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 CH12, one of those codes.

Code name (*): CH12 (See the descriptive data below.)

Persons (*): 2 (counting humans only)

Projects (*): 0 (counting projects only)

Display (HTML): Propper, Batalov, Primo, OpenPFGW, CHG

Number of primes: total 1

Unverified Primes: 0 (prime table entries marked 'Composite','Untested', or 'InProcess')

Score for Primes (*): total 37.9996, on current list 37.9996

Entrance Rank (*): mean 50329.00 (minimum 50329, maximum 50329)

Descriptive Data: (report abuse)

This code is used for proofs of generalized Lucas and Lehmer numbers and their primitive parts.
The following software was used:
(1) Pari-GP for cyclotomic (and, where appropriate, Aurifeuillian) factorizations of N^2-1.
(2) GMP-ECM, Msieve, YAFU and ggnfs for extracting PrP factors of such cyclotomic cofactors.
(3) Pari-GP and Primo (when needed) for proving these helpers prime.
(4) OpenPFGW for BLS tests with these prime helpers.
(5) Pari-GP for Coppersmith--Howgrave-Graham, Williams--Lenstra, or Konyagin--Pomerance proofs, where BLS was insufficient.
(6) David Broadhurst's (with J.Renze) CHGserve implementation for CHG

I am a member of this code and I would like to:This code is used for proofs of generalized Lucas and Lehmer numbers and their primitive parts.
The following software was used:
(1) Pari-GP for cyclotomic (and, where appropriate, Aurifeuillian) factorizations of N^2-1.
(2) GMP-ECM, Msieve, YAFU and ggnfs for extracting PrP factors of such cyclotomic cofactors.
(3) Pari-GP and Primo (when needed) for proving these helpers prime.
(4) OpenPFGW for BLS tests with these prime helpers.
(5) Pari-GP for Coppersmith--Howgrave-Graham, Williams--Lenstra, or Konyagin--Pomerance proofs, where BLS was insufficient.
(6) David Broadhurst's (with J.Renze) CHGserve implementation for CHG

Below is additional information about this entry.

Display (text): Propper, Batalov, Primo, OpenPFGW, CHG

Display (short): Propper & Batalov

Database id: 9106 (do not use this database id, it is subject to change)

Proof program: CHG The primes from this code accounts for 4.000% of the (active) primes and 0.009% of the (active) score for this program.

Entry last modified: 2021-02-26 16:20:24

Code name (*):	CH12 (See the descriptive data below.)
Persons (*):	2 (counting humans only)
Projects (*):	0 (counting projects only)
Display (HTML):	Propper, Batalov, Primo, OpenPFGW, CHG
Number of primes:	total 1
Unverified Primes:	0 (prime table entries marked 'Composite','Untested', or 'InProcess')
Score for Primes (*):	total 37.9996, on current list 37.9996
Entrance Rank (*):	mean 50329.00 (minimum 50329, maximum 50329)

Display (text):	Propper, Batalov, Primo, OpenPFGW, CHG
Display (short):	Propper & Batalov
Database id:	9106 (do not use this database id, it is subject to change)
Proof program:	CHG The primes from this code accounts for 4.000% of the (active) primes and 0.009% of the (active) score for this program.
Entry last modified:	2021-02-26 16:20:24