Block #470,604

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/2/2014, 12:52:13 AM · Difficulty 10.4310 · 6,346,231 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4d914459e8f03b939bd3b91e2aa866e72a531eb7b6018f78737edb7735de390f

Height

#470,604

Difficulty

10.431026

Transactions

3

Size

1.36 KB

Version

2

Bits

0a6e57bf

Nonce

16,980

Timestamp

4/2/2014, 12:52:13 AM

Confirmations

6,346,231

Merkle Root

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

8.531 × 10¹⁰⁵(106-digit number)
85310820114253513399…68253899316287121921
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
8.531 × 10¹⁰⁵(106-digit number)
85310820114253513399…68253899316287121921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.706 × 10¹⁰⁶(107-digit number)
17062164022850702679…36507798632574243841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.412 × 10¹⁰⁶(107-digit number)
34124328045701405359…73015597265148487681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.824 × 10¹⁰⁶(107-digit number)
68248656091402810719…46031194530296975361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.364 × 10¹⁰⁷(108-digit number)
13649731218280562143…92062389060593950721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.729 × 10¹⁰⁷(108-digit number)
27299462436561124287…84124778121187901441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.459 × 10¹⁰⁷(108-digit number)
54598924873122248575…68249556242375802881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.091 × 10¹⁰⁸(109-digit number)
10919784974624449715…36499112484751605761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.183 × 10¹⁰⁸(109-digit number)
21839569949248899430…72998224969503211521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.367 × 10¹⁰⁸(109-digit number)
43679139898497798860…45996449939006423041
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,778,720 XPM·at block #6,816,834 · 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