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: 26384405 + 44052638 Verification status (*): PRP Official Comment: ECPP Proof-code(s): (*): FE3 : Wirth, Kleinjung, Franke, Morain, FastECPP Decimal Digits: 15071   (log10 is 15070.7154552816) Rank (*): 58224 (digit rank is 1) Entrance Rank (*): 19815 Currently on list? (*): short Submitted: 7/20/2004 Last modified: 9/28/2004 14:21:33 CDT Database id: 71753 Status Flags: Verify Score (*): 33.7106 (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: yes, rank 12
Subcategory: "ECPP"
(archival tag id 192517, tag last modified 2013-05-18 19:50:29)

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 71753 person_id 9 machine Linux P4 2.8GHz what prp notes Command: /home/caldwell/client/pfgw -f -tc -q"2638^4405+4405^2638" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 2638^4405+4405^2638 [N-1/N+1, Brillhart-Lehmer-Selfridge] trial factoring to 4474075 Running N-1 test using base 3 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(6144,21) to FFT(6144,20) Reduced from FFT(6144,20) to FFT(6144,19) Reduced from FFT(6144,19) to FFT(6144,18) Reduced from FFT(6144,18) to FFT(6144,17) 100136 bit request FFT size=(6144,17) Running N+1 test using discriminant 19, base 3+sqrt(19) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(6144,21) to FFT(6144,20) Reduced from FFT(6144,20) to FFT(6144,19) Reduced from FFT(6144,19) to FFT(6144,18) Reduced from FFT(6144,18) to FFT(6144,17) 100144 bit request FFT size=(6144,17) Running N+1 test using discriminant 19, base 4+sqrt(19) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(6144,21) to FFT(6144,20) Reduced from FFT(6144,20) to FFT(6144,19) Reduced from FFT(6144,19) to FFT(6144,18) Reduced from FFT(6144,18) to FFT(6144,17) 100144 bit request FFT size=(6144,17) Calling N-1 BLS with factored part 0.07% and helper 0.04% (0.25% proof) 2638^4405+4405^2638 is Fermat and Lucas PRP! (353.9565s+0.0225s) modified 2004-11-20 19:47:50 created 2004-09-28 14:23:00 id 76747