Block #424,037

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/28/2014, 9:26:44 PM · Difficulty 10.3710 · 6,403,257 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d218a35735cd78803cce4efbad4d4930a9d8ab11e3ce04519d54a5e6c0bc3111

Height

#424,037

Difficulty

10.370950

Transactions

1

Size

971 B

Version

2

Bits

0a5ef695

Nonce

5,056

Timestamp

2/28/2014, 9:26:44 PM

Confirmations

6,403,257

Merkle Root

074354e16b4a98bfec0c08418a1b95fb3ff9e1bc1a3598edc72dd9a076a7aed7
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.923 × 10⁹⁸(99-digit number)
99239637406353515948…35859856292278669761
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.923 × 10⁹⁸(99-digit number)
99239637406353515948…35859856292278669761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.984 × 10⁹⁹(100-digit number)
19847927481270703189…71719712584557339521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.969 × 10⁹⁹(100-digit number)
39695854962541406379…43439425169114679041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.939 × 10⁹⁹(100-digit number)
79391709925082812758…86878850338229358081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.587 × 10¹⁰⁰(101-digit number)
15878341985016562551…73757700676458716161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.175 × 10¹⁰⁰(101-digit number)
31756683970033125103…47515401352917432321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.351 × 10¹⁰⁰(101-digit number)
63513367940066250207…95030802705834864641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.270 × 10¹⁰¹(102-digit number)
12702673588013250041…90061605411669729281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.540 × 10¹⁰¹(102-digit number)
25405347176026500082…80123210823339458561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.081 × 10¹⁰¹(102-digit number)
50810694352053000165…60246421646678917121
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,862,461 XPM·at block #6,827,293 · 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