Block #450,289

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/19/2014, 5:06:46 AM · Difficulty 10.3696 · 6,359,967 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f5ded4cf1178c4bf853419435d438d9110e223bff143347a61ad4a3de2cd5a9f

Height

#450,289

Difficulty

10.369614

Transactions

3

Size

2.20 KB

Version

2

Bits

0a5e9f0c

Nonce

3,427,789,057

Timestamp

3/19/2014, 5:06:46 AM

Confirmations

6,359,967

Merkle Root

ac10ab7c0d49565b1eeea405c9fa3deeeba9364d1a5e5e68c7ab19da414afc0c
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.

2.121 × 10¹⁰⁹(110-digit number)
21212569692398205642…80026351215191897601
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
2.121 × 10¹⁰⁹(110-digit number)
21212569692398205642…80026351215191897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.242 × 10¹⁰⁹(110-digit number)
42425139384796411285…60052702430383795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.485 × 10¹⁰⁹(110-digit number)
84850278769592822571…20105404860767590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.697 × 10¹¹⁰(111-digit number)
16970055753918564514…40210809721535180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.394 × 10¹¹⁰(111-digit number)
33940111507837129028…80421619443070361601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.788 × 10¹¹⁰(111-digit number)
67880223015674258056…60843238886140723201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.357 × 10¹¹¹(112-digit number)
13576044603134851611…21686477772281446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.715 × 10¹¹¹(112-digit number)
27152089206269703222…43372955544562892801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.430 × 10¹¹¹(112-digit number)
54304178412539406445…86745911089125785601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.086 × 10¹¹²(113-digit number)
10860835682507881289…73491822178251571201
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,726,121 XPM·at block #6,810,255 · 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