Block #476,989

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/6/2014, 4:46:12 AM · Difficulty 10.4763 · 6,332,406 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
22c233446b1183e916ec96a1df5a58af176b723d9eddee46dca7f9ae6ed52539

Height

#476,989

Difficulty

10.476282

Transactions

5

Size

2.09 KB

Version

2

Bits

0a79ed96

Nonce

149,735

Timestamp

4/6/2014, 4:46:12 AM

Confirmations

6,332,406

Merkle Root

0cd525aa5852c3e047bc5f482a705068687fbad1813c1f94d78737320a0d3157
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.584 × 10¹⁰⁰(101-digit number)
35843236428652566967…24399692047883552001
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.584 × 10¹⁰⁰(101-digit number)
35843236428652566967…24399692047883552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.168 × 10¹⁰⁰(101-digit number)
71686472857305133934…48799384095767104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.433 × 10¹⁰¹(102-digit number)
14337294571461026786…97598768191534208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.867 × 10¹⁰¹(102-digit number)
28674589142922053573…95197536383068416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.734 × 10¹⁰¹(102-digit number)
57349178285844107147…90395072766136832001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.146 × 10¹⁰²(103-digit number)
11469835657168821429…80790145532273664001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.293 × 10¹⁰²(103-digit number)
22939671314337642858…61580291064547328001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.587 × 10¹⁰²(103-digit number)
45879342628675285717…23160582129094656001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.175 × 10¹⁰²(103-digit number)
91758685257350571435…46321164258189312001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.835 × 10¹⁰³(104-digit number)
18351737051470114287…92642328516378624001
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,719,233 XPM·at block #6,809,394 · 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