Block #408,519

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/17/2014, 5:23:41 PM · Difficulty 10.4307 · 6,408,208 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1e3c02f0788c3a03850205473f6394db21cd6fd8b16499fa26cbdcce4f8bd271

Height

#408,519

Difficulty

10.430735

Transactions

1

Size

936 B

Version

2

Bits

0a6e44ab

Nonce

284

Timestamp

2/17/2014, 5:23:41 PM

Confirmations

6,408,208

Merkle Root

60cff1e79eb9c17781d50dbb22db56fcdafbb8f32296dcb87db078845321888f
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.

3.634 × 10⁹⁶(97-digit number)
36343724577213895975…94665638589279900161
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
3.634 × 10⁹⁶(97-digit number)
36343724577213895975…94665638589279900161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.268 × 10⁹⁶(97-digit number)
72687449154427791951…89331277178559800321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.453 × 10⁹⁷(98-digit number)
14537489830885558390…78662554357119600641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.907 × 10⁹⁷(98-digit number)
29074979661771116780…57325108714239201281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.814 × 10⁹⁷(98-digit number)
58149959323542233561…14650217428478402561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.162 × 10⁹⁸(99-digit number)
11629991864708446712…29300434856956805121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.325 × 10⁹⁸(99-digit number)
23259983729416893424…58600869713913610241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.651 × 10⁹⁸(99-digit number)
46519967458833786849…17201739427827220481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.303 × 10⁹⁸(99-digit number)
93039934917667573698…34403478855654440961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.860 × 10⁹⁹(100-digit number)
18607986983533514739…68806957711308881921
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,777,850 XPM·at block #6,816,726 · 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