Block #394,022

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/7/2014, 1:57:41 PM · Difficulty 10.4374 · 6,433,017 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9b944eed98383fbcc02fd3c2014ce2fc9ca47361771c9477b910b1fae8c46316

Height

#394,022

Difficulty

10.437355

Transactions

11

Size

3.37 KB

Version

2

Bits

0a6ff685

Nonce

39,736

Timestamp

2/7/2014, 1:57:41 PM

Confirmations

6,433,017

Merkle Root

cffba5158d6d6d86414c2f821563e5378fb10cd9a3d1234d56537efbe12cf49d
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.

7.706 × 10¹⁰⁶(107-digit number)
77062625560425019576…25115327114178112001
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
7.706 × 10¹⁰⁶(107-digit number)
77062625560425019576…25115327114178112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.541 × 10¹⁰⁷(108-digit number)
15412525112085003915…50230654228356224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.082 × 10¹⁰⁷(108-digit number)
30825050224170007830…00461308456712448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.165 × 10¹⁰⁷(108-digit number)
61650100448340015661…00922616913424896001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.233 × 10¹⁰⁸(109-digit number)
12330020089668003132…01845233826849792001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.466 × 10¹⁰⁸(109-digit number)
24660040179336006264…03690467653699584001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.932 × 10¹⁰⁸(109-digit number)
49320080358672012529…07380935307399168001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.864 × 10¹⁰⁸(109-digit number)
98640160717344025058…14761870614798336001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.972 × 10¹⁰⁹(110-digit number)
19728032143468805011…29523741229596672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.945 × 10¹⁰⁹(110-digit number)
39456064286937610023…59047482459193344001
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,860,492 XPM·at block #6,827,038 · 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