Block #413,366

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/21/2014, 4:55:46 AM · Difficulty 10.4138 · 6,402,711 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c09bc0caa7466b223612ac8d6630e5b35783e1945a2f4368ce48377d48812e5f

Height

#413,366

Difficulty

10.413771

Transactions

8

Size

2.61 KB

Version

2

Bits

0a69ece5

Nonce

137,580

Timestamp

2/21/2014, 4:55:46 AM

Confirmations

6,402,711

Merkle Root

99cbe9ba3377a38633baed1a358bbe7f312dd52fa744efaa41b5b50d9e2ee296
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.

1.018 × 10¹⁰²(103-digit number)
10183147269208839225…14429208259757568001
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
1.018 × 10¹⁰²(103-digit number)
10183147269208839225…14429208259757568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.036 × 10¹⁰²(103-digit number)
20366294538417678451…28858416519515136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.073 × 10¹⁰²(103-digit number)
40732589076835356902…57716833039030272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.146 × 10¹⁰²(103-digit number)
81465178153670713804…15433666078060544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.629 × 10¹⁰³(104-digit number)
16293035630734142760…30867332156121088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.258 × 10¹⁰³(104-digit number)
32586071261468285521…61734664312242176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.517 × 10¹⁰³(104-digit number)
65172142522936571043…23469328624484352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.303 × 10¹⁰⁴(105-digit number)
13034428504587314208…46938657248968704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.606 × 10¹⁰⁴(105-digit number)
26068857009174628417…93877314497937408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.213 × 10¹⁰⁴(105-digit number)
52137714018349256834…87754628995874816001
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,772,734 XPM·at block #6,816,076 · 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