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

Code name (* ):x41 (See the descriptive data below.)
Persons (* ):4 (counting humans only)
Projects (* ):0 (counting projects only)
Display (HTML) :Abatzoglou , Wong3 , Silverberg , Sutherland
Number of primes :total 4
Unverified Primes :0 (prime table entries marked 'Composite','Untested', or 'InProcess')
Score for Primes (* ):total 44.6134, on current list 43.9630 (normalized score 1)
Entrance Rank (* ):mean 1427.00 (minimum 1427, maximum 1427)

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

Descriptive Data:
(report abuse )
Pomerance-type elliptic curve primality proof. Uses a point
of order 2^n on the reduction of an elliptic curve that has
complex multiplication, as described by Abatzoglou,
Silverberg, Sutherland, and Wong in
http://arxiv.org/abs/1202.3695, where the elliptic curve is
defined over Q and the CM field is Q(sqrt(-7)), and also in
http://arxiv.org/abs/1404.0107, where the elliptic curve is
defined over Q(sqrt(5)) and the CM field is Q(sqrt(-15).

Below is additional information about this entry.

Display (text): Abatzoglou, Wong3, Silverberg, Sutherland
Display (short): Abatzoglou, Wong3, Silverberg & Sutherland
Database id: 6634 (do not use this database id, it is subject to change)
Proof program: unknown
Entry last modified: 2017-10-21 23:20:15