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: 19952438+24381995 Verification status (*): PRP Official Comment: ECPP Unofficial Comments: This prime has 1 user comment below. Proof-code(s): (*): FE1 : Morain, FastECPP Decimal Digits: 8046   (log10 is 8045.26079026) Rank (*): 46203 (digit rank is 2) Entrance Rank (*): 23063 Currently on list? (*): no Submitted: 9/3/2003 Last modified: 10/4/2003 08:59:28 CDT Database id: 66470 Status Flags: Verify Score (*): 31.7657 (normalized score 0.0001)

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: no, rank 21
Subcategory: "ECPP"
(archival tag id 194495, tag last modified 2009-11-22 06:50:29)

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.

Chris Caldwell writes (26 Nov 2005): 

For more information see [FKMW2003].

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 66470 person_id 9 machine Linux P4 2.8GHz what prp notes Command: /home/caldwell/client/pfgw -f -tc -q"1995^2438+2438^1995" 2>&1 PFGW Version 20030811.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] trial factoring to 2270966 Running N-1 test using base 3 Primality testing 1995^2438+2438^1995 [N-1/N+1, Brillhart-Lehmer-Selfridge] Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(3072,21) to FFT(3072,20) Reduced from FFT(3072,20) to FFT(3072,19) Reduced from FFT(3072,19) to FFT(3072,18) 53460 bit request FFT size=(3072,18) Running N+1 test using discriminant 11, base 1+sqrt(11) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(3072,21) to FFT(3072,20) Reduced from FFT(3072,20) to FFT(3072,19) Reduced from FFT(3072,19) to FFT(3072,18) 53468 bit request FFT size=(3072,18) Running N+1 test using discriminant 11, base 4+sqrt(11) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(3072,21) to FFT(3072,20) Reduced from FFT(3072,20) to FFT(3072,19) Reduced from FFT(3072,19) to FFT(3072,18) 53468 bit request FFT size=(3072,18) Running N+1 test using discriminant 11, base 9+sqrt(11) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(3072,21) to FFT(3072,20) Reduced from FFT(3072,20) to FFT(3072,19) Reduced from FFT(3072,19) to FFT(3072,18) 53468 bit request FFT size=(3072,18) Calling N-1 BLS with factored part 0.10% and helper 0.09% (0.41% proof) 1995^2438+2438^1995 is Fermat and Lucas PRP! (171.0016s+0.0125s) modified 2003-10-11 11:27:20 created 2003-10-04 09:23:01 id 71375