Block #430,411

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/5/2014, 11:53:04 AM · Difficulty 10.3423 · 6,380,049 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3f2948911986b02e2121f0ed4c8d3fea7e9bd6ab71766e1a7e8a82f2e45e9d44

Height

#430,411

Difficulty

10.342268

Transactions

3

Size

660 B

Version

2

Bits

0a579ed8

Nonce

62,615

Timestamp

3/5/2014, 11:53:04 AM

Confirmations

6,380,049

Merkle Root

d81e56abb69b123c21226a41f7c01e49e12cffd69d44533fc10079463b9bab6a
Transactions (3)
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.

9.606 × 10¹⁰¹(102-digit number)
96066493739205639929…06084175890364172161
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
9.606 × 10¹⁰¹(102-digit number)
96066493739205639929…06084175890364172161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.921 × 10¹⁰²(103-digit number)
19213298747841127985…12168351780728344321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.842 × 10¹⁰²(103-digit number)
38426597495682255971…24336703561456688641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.685 × 10¹⁰²(103-digit number)
76853194991364511943…48673407122913377281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.537 × 10¹⁰³(104-digit number)
15370638998272902388…97346814245826754561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.074 × 10¹⁰³(104-digit number)
30741277996545804777…94693628491653509121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.148 × 10¹⁰³(104-digit number)
61482555993091609554…89387256983307018241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.229 × 10¹⁰⁴(105-digit number)
12296511198618321910…78774513966614036481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.459 × 10¹⁰⁴(105-digit number)
24593022397236643821…57549027933228072961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.918 × 10¹⁰⁴(105-digit number)
49186044794473287643…15098055866456145921
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,727,767 XPM·at block #6,810,459 · 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