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

Code name (* ):L4879 (See the descriptive data below.)
Persons (* ):2 (counting humans only)
Projects (* ):0 (counting projects only)
Display (HTML) :Propper , Batalov , Srsieve , LLR
Number of primes :total 9
Unverified Primes :0 (prime table entries marked 'Composite','Untested', or 'InProcess')
Score for Primes (* ):total 49.7896, on current list 49.7896 (normalized score 307)
Entrance Rank (* ):mean 147.56 (minimum 72, maximum 202)

I am a member of this code and I would like to:

Descriptive Data:
(report abuse )
This code is primarily used for testing certain Proth
primes, and determining order of 2 modulo these primes.
Following tradition, Proth.exe was initially used for the
latter, but this was later refactored with a much faster
solution based on minor changes to the code of LLR v.3.8.d.
Order of 2 modulo primes where base is composite is only
possible with this code (Proth.exe accepts k*q^n+1 only
with prime q for the order test).
Some other srsieve'd+LLR'd primes also fit this code
(e.g. Near-repdigits).

Below is additional information about this entry.

Display (text): Propper, Batalov, Srsieve, LLR
Display (short): Propper & Batalov
Database id: 8822 (do not use this database id, it is subject to change)
Proof program: LLR The primes from this code accounts for 0.184% of the (active) primes and 0.457% of the (active) score for this program.
Entry last modified: 2019-11-15 00:20:16