
At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly. This list is the most important databases at The Prime Pages: a collection of research, records and results all about prime numbers. This page summarizes our information about one of these primes. This prime's information:
field (help)  value 
Description:  "τ(41^{2296})" 
Verification status (*):  Proven 
Official Comment:  ECPP 
Unofficial Comments:  This prime has 1 user comment below. 
Proofcode(s): (*):  c91 : Lygeros, Rozier, Morain, Primo 
Decimal Digits:  20367 (log_{10} is 20366.239694378) 
Rank (*):  65096 (digit rank is 1) 
Entrance Rank (*):  63986 
Currently on list? (*):  short 
Submitted:  4/13/2018 14:19:15 CDT 
Last modified:  4/13/2018 14:26:56 CDT 
Database id:  124584 
Blob database id:  381 
Status Flags:  Verify, TrialDiv 
Score (*):  34.6424 (normalized score 0) 

Description:
(from blob table id=381)
ECPP
Archival tags:
There are certain forms classed as
archivable: these prime may (at times)
remain on this list even if they do not make
the Top 5000 proper. Such primes are tracked with archival
tags.
 Elliptic Curve Primality Proof (archivable *)
 Prime on list: yes, rank 20
Subcategory: "ECPP"
(archival tag id 219108, tag last modified 20190216 16:50:05)
User comments about this prime (disclaimer):
User comments are allowed to convey mathematical information about this number, how it was proven prime.... See our guidelines and restrictions.
Verification data:
The Top 5000 Primes is a list for proven primes only. In order to maintain the
integrity of this list, we seek to verify the primality of all submissions.
We are currently unable to check all proofs (ECPP, KP, ...), but we will at least trial
divide and PRP
check every entry before it is included in the list.
field  value 
prime_id  124584 
person_id  9 
machine  Using: Xeon 4c+4c 3.5GHz 
what  prp 
notes  PFGW Version 3.7.7.64BIT.20130722.x86_Dev [GWNUM 27.11] Primality testing 1736578332...8483513063 [N1/N+1, BrillhartLehmerSelfridge] Running N1 test using base 5 Running N+1 test using discriminant 23, base 1+sqrt(23) Calling N+1 BLS with factored part 0.05% and helper 0.02% (0.17% proof)
1736578332...8483513063 is Fermat and Lucas PRP! (35.1306s+0.0077s) [Elapsed time: 35.00 seconds]

modified  20180925 13:41:13 
created  20180413 14:21:01 
id  170250 

Query times: 0.0004 seconds to select prime, 0.0008 seconds to seek comments.
