Block #422,578

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/27/2014, 8:47:09 PM · Difficulty 10.3728 · 6,386,047 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f6ac8461fbedb1ee032772a4d0d143443137be618517f218713300f231dbaced

Height

#422,578

Difficulty

10.372782

Transactions

2

Size

1.44 KB

Version

2

Bits

0a5f6ea0

Nonce

82,749

Timestamp

2/27/2014, 8:47:09 PM

Confirmations

6,386,047

Merkle Root

dffc066185786f42a69f85927442d08deaa31bdac8bd65e1e885981e767ccdf5
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.474 × 10⁹⁷(98-digit number)
24748565374791882226…85504437641311424001
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.474 × 10⁹⁷(98-digit number)
24748565374791882226…85504437641311424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.949 × 10⁹⁷(98-digit number)
49497130749583764452…71008875282622848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.899 × 10⁹⁷(98-digit number)
98994261499167528905…42017750565245696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.979 × 10⁹⁸(99-digit number)
19798852299833505781…84035501130491392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.959 × 10⁹⁸(99-digit number)
39597704599667011562…68071002260982784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.919 × 10⁹⁸(99-digit number)
79195409199334023124…36142004521965568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.583 × 10⁹⁹(100-digit number)
15839081839866804624…72284009043931136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.167 × 10⁹⁹(100-digit number)
31678163679733609249…44568018087862272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.335 × 10⁹⁹(100-digit number)
63356327359467218499…89136036175724544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.267 × 10¹⁰⁰(101-digit number)
12671265471893443699…78272072351449088001
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,713,051 XPM·at block #6,808,624 · 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