Block #436,226

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/9/2014, 11:15:46 AM · Difficulty 10.3575 · 6,374,787 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6b955f12a7709b4c5a71ea9552e203c75a392948e3b9a7aed164b61f06c6c489

Height

#436,226

Difficulty

10.357525

Transactions

5

Size

1.68 KB

Version

2

Bits

0a5b86c5

Nonce

224,911

Timestamp

3/9/2014, 11:15:46 AM

Confirmations

6,374,787

Merkle Root

1ef76a302344648dbb9ac7bffda6e18c608765223fd28ebcddf7ac422273667f
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.

6.978 × 10⁹⁸(99-digit number)
69788652526656501886…30547682953462236481
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
6.978 × 10⁹⁸(99-digit number)
69788652526656501886…30547682953462236481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.395 × 10⁹⁹(100-digit number)
13957730505331300377…61095365906924472961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.791 × 10⁹⁹(100-digit number)
27915461010662600754…22190731813848945921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.583 × 10⁹⁹(100-digit number)
55830922021325201509…44381463627697891841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.116 × 10¹⁰⁰(101-digit number)
11166184404265040301…88762927255395783681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.233 × 10¹⁰⁰(101-digit number)
22332368808530080603…77525854510791567361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.466 × 10¹⁰⁰(101-digit number)
44664737617060161207…55051709021583134721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.932 × 10¹⁰⁰(101-digit number)
89329475234120322414…10103418043166269441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.786 × 10¹⁰¹(102-digit number)
17865895046824064482…20206836086332538881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.573 × 10¹⁰¹(102-digit number)
35731790093648128965…40413672172665077761
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,732,209 XPM·at block #6,811,012 · 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.

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