Block #562,688

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/26/2014, 7:45:57 AM · Difficulty 10.9659 · 6,247,226 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ad0071a2886832c7b37e4f8f5028e48229069df6c4bc2b44bc610ff35b4f7aa3

Height

#562,688

Difficulty

10.965899

Transactions

3

Size

4.44 KB

Version

2

Bits

0af74522

Nonce

604,161,990

Timestamp

5/26/2014, 7:45:57 AM

Confirmations

6,247,226

Merkle Root

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

2.799 × 10⁹⁷(98-digit number)
27990947293465277313…91815258596915801301
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
2.799 × 10⁹⁷(98-digit number)
27990947293465277313…91815258596915801301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.598 × 10⁹⁷(98-digit number)
55981894586930554627…83630517193831602601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.119 × 10⁹⁸(99-digit number)
11196378917386110925…67261034387663205201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.239 × 10⁹⁸(99-digit number)
22392757834772221851…34522068775326410401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.478 × 10⁹⁸(99-digit number)
44785515669544443702…69044137550652820801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.957 × 10⁹⁸(99-digit number)
89571031339088887404…38088275101305641601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.791 × 10⁹⁹(100-digit number)
17914206267817777480…76176550202611283201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.582 × 10⁹⁹(100-digit number)
35828412535635554961…52353100405222566401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.165 × 10⁹⁹(100-digit number)
71656825071271109923…04706200810445132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.433 × 10¹⁰⁰(101-digit number)
14331365014254221984…09412401620890265601
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,723,396 XPM·at block #6,809,913 · 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