Block #456,169

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/23/2014, 1:07:22 AM · Difficulty 10.4167 · 6,333,801 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d34c8a67757dfffe9edb4990b46089bb73ccd2b222ecdb318f49f05441299317

Height

#456,169

Difficulty

10.416749

Transactions

7

Size

7.80 KB

Version

2

Bits

0a6ab014

Nonce

5,700

Timestamp

3/23/2014, 1:07:22 AM

Confirmations

6,333,801

Merkle Root

12656b40a09afd38dea6109ac676af706ce4e3e4180506f2c3d36ecfdba9cc5f
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.083 × 10⁹⁹(100-digit number)
20830629952309628205…01339622245766118401
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.083 × 10⁹⁹(100-digit number)
20830629952309628205…01339622245766118401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.166 × 10⁹⁹(100-digit number)
41661259904619256411…02679244491532236801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.332 × 10⁹⁹(100-digit number)
83322519809238512823…05358488983064473601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.666 × 10¹⁰⁰(101-digit number)
16664503961847702564…10716977966128947201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.332 × 10¹⁰⁰(101-digit number)
33329007923695405129…21433955932257894401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.665 × 10¹⁰⁰(101-digit number)
66658015847390810258…42867911864515788801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.333 × 10¹⁰¹(102-digit number)
13331603169478162051…85735823729031577601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.666 × 10¹⁰¹(102-digit number)
26663206338956324103…71471647458063155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.332 × 10¹⁰¹(102-digit number)
53326412677912648207…42943294916126310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.066 × 10¹⁰²(103-digit number)
10665282535582529641…85886589832252620801
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,563,737 XPM·at block #6,789,969 · updates every 60s