Block #562,459

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/26/2014, 2:54:31 AM · Difficulty 10.9663 · 6,248,672 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6502b3f61e84e1ebdfae03b97e6a15471fe1b821ba8d04fed8fb657f5545b899

Height

#562,459

Difficulty

10.966320

Transactions

5

Size

9.40 KB

Version

2

Bits

0af760c7

Nonce

112,176,768

Timestamp

5/26/2014, 2:54:31 AM

Confirmations

6,248,672

Merkle Root

71983c2dbfe5ae851fd653cc5400d22ab17b1b29fac38f718affb9a97ace1aab
Transactions (5)
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.119 × 10⁹⁸(99-digit number)
11195552678832375238…60398587709464600001
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.119 × 10⁹⁸(99-digit number)
11195552678832375238…60398587709464600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.239 × 10⁹⁸(99-digit number)
22391105357664750477…20797175418929200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.478 × 10⁹⁸(99-digit number)
44782210715329500955…41594350837858400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.956 × 10⁹⁸(99-digit number)
89564421430659001911…83188701675716800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.791 × 10⁹⁹(100-digit number)
17912884286131800382…66377403351433600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.582 × 10⁹⁹(100-digit number)
35825768572263600764…32754806702867200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.165 × 10⁹⁹(100-digit number)
71651537144527201529…65509613405734400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.433 × 10¹⁰⁰(101-digit number)
14330307428905440305…31019226811468800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.866 × 10¹⁰⁰(101-digit number)
28660614857810880611…62038453622937600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.732 × 10¹⁰⁰(101-digit number)
57321229715621761223…24076907245875200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.146 × 10¹⁰¹(102-digit number)
11464245943124352244…48153814491750400001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,733,155 XPM·at block #6,811,130 · 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