Block #641,113

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/20/2014, 6:05:17 PM · Difficulty 10.9575 · 6,174,026 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
4ea733a3984e01886518b35d89c55e243313b2e95f259ce57a089750b36d7840

Height

#641,113

Difficulty

10.957486

Transactions

2

Size

465 B

Version

2

Bits

0af51dc7

Nonce

398,597,564

Timestamp

7/20/2014, 6:05:17 PM

Confirmations

6,174,026

Merkle Root

4e54e0c2a62f3bab60ce5f3f0f5d66ff9e1a6d10fdaca420a27f4b657f6ad248
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

3.638 × 10⁹⁴(95-digit number)
36382078747937895475…75409667712322290361
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
3.638 × 10⁹⁴(95-digit number)
36382078747937895475…75409667712322290361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.276 × 10⁹⁴(95-digit number)
72764157495875790950…50819335424644580721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.455 × 10⁹⁵(96-digit number)
14552831499175158190…01638670849289161441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.910 × 10⁹⁵(96-digit number)
29105662998350316380…03277341698578322881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.821 × 10⁹⁵(96-digit number)
58211325996700632760…06554683397156645761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.164 × 10⁹⁶(97-digit number)
11642265199340126552…13109366794313291521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.328 × 10⁹⁶(97-digit number)
23284530398680253104…26218733588626583041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.656 × 10⁹⁶(97-digit number)
46569060797360506208…52437467177253166081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.313 × 10⁹⁶(97-digit number)
93138121594721012416…04874934354506332161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.862 × 10⁹⁷(98-digit number)
18627624318944202483…09749868709012664321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.725 × 10⁹⁷(98-digit number)
37255248637888404966…19499737418025328641
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★★☆☆
Rarity
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,765,205 XPM·at block #6,815,138 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy