Block #451,208

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/19/2014, 6:45:16 PM · Difficulty 10.3827 · 6,365,139 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
955167be2e267c7479c1cae6d6164bad152860750ea8fa49866024dd7e8ed346

Height

#451,208

Difficulty

10.382710

Transactions

2

Size

1.42 KB

Version

2

Bits

0a61f940

Nonce

21,454

Timestamp

3/19/2014, 6:45:16 PM

Confirmations

6,365,139

Merkle Root

26339207fcc7a2efc09f8c91281fbbb5b312113cf907ec9d3dbbb7c91cb51523
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.671 × 10¹⁰⁹(110-digit number)
36717962391517503614…21624898231572833281
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.671 × 10¹⁰⁹(110-digit number)
36717962391517503614…21624898231572833281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.343 × 10¹⁰⁹(110-digit number)
73435924783035007229…43249796463145666561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.468 × 10¹¹⁰(111-digit number)
14687184956607001445…86499592926291333121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.937 × 10¹¹⁰(111-digit number)
29374369913214002891…72999185852582666241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.874 × 10¹¹⁰(111-digit number)
58748739826428005783…45998371705165332481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.174 × 10¹¹¹(112-digit number)
11749747965285601156…91996743410330664961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.349 × 10¹¹¹(112-digit number)
23499495930571202313…83993486820661329921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.699 × 10¹¹¹(112-digit number)
46998991861142404627…67986973641322659841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.399 × 10¹¹¹(112-digit number)
93997983722284809254…35973947282645319681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.879 × 10¹¹²(113-digit number)
18799596744456961850…71947894565290639361
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,774,900 XPM·at block #6,816,346 · 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