
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:  (2^{108127}  1)^{2}  2 
Verification status (*):  Proven 
Official Comment:  
Proofcode(s): (*):  p137 : Rodenkirch, MultiSieve, OpenPFGW 
Decimal Digits:  65099 (log_{10} is 65098.9406823186) 
Rank (*):  48686 (digit rank is 1) 
Entrance Rank (*):  1223 
Currently on list? (*):  no 
Submitted:  4/22/2004 18:56:57 CDT 
Last modified:  4/22/2004 18:56:57 CDT 
Removed (*):  2/2/2006 14:15:07 CDT 
Database id:  70044 
Status Flags:  none 
Score (*):  38.2311 (normalized score 0.0028) 

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  70044 
person_id  9 
machine  Linux P4 2.8GHz 
what  prime 
notes  Command: /home/caldwell/client/pfgw f tc q"(2^1081271)^22" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing (2^1081271)^22 [N1/N+1, BrillhartLehmerSelfridge] trial factoring to 21541149 Running N1 test using base 5 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(28672,20) to FFT(28672,19) Reduced from FFT(28672,19) to FFT(28672,18) Reduced from FFT(28672,18) to FFT(28672,17) Reduced from FFT(28672,17) to FFT(28672,16) 432516 bit request FFT size=(28672,16) Running N+1 test using discriminant 11, base 2+sqrt(11) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(28672,20) to FFT(28672,19) Reduced from FFT(28672,19) to FFT(28672,18) Reduced from FFT(28672,18) to FFT(28672,17) Reduced from FFT(28672,17) to FFT(28672,16) 432524 bit request FFT size=(28672,16) Running N+1 test using discriminant 11, base 3+sqrt(11) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(28672,20) to FFT(28672,19) Reduced from FFT(28672,19) to FFT(28672,18) Reduced from FFT(28672,18) to FFT(28672,17) Reduced from FFT(28672,17) to FFT(28672,16) 432524 bit request FFT size=(28672,16) 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(28672,20) to FFT(28672,19) Reduced from FFT(28672,19) to FFT(28672,18) Reduced from FFT(28672,18) to FFT(28672,17) Reduced from FFT(28672,17) to FFT(28672,16) 432524 bit request FFT size=(28672,16) Calling N+1 BLS with factored part 50.02% and helper 0.02% (150.07% proof) (2^1081271)^22 is prime! (2106.7646s+0.0000s)

modified  20040805 12:46:56 
created  20040425 06:53:01 
id  75013 

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