Block #562,997

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/26/2014, 3:53:52 PM · Difficulty 10.9647 · 6,246,339 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e9bc3239d83b9aeae16c6107b6a0263658a5b1c5ca2502b854ae05a69402dfc3

Height

#562,997

Difficulty

10.964679

Transactions

1

Size

594 B

Version

2

Bits

0af6f537

Nonce

61,496

Timestamp

5/26/2014, 3:53:52 PM

Confirmations

6,246,339

Merkle Root

805624dac45ab8b294e0d9b9eb60fa9e778b1f85ae969627ad58e0a22f8c9e90
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.189 × 10⁹³(94-digit number)
11896024932381476692…50956454734152524801
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.189 × 10⁹³(94-digit number)
11896024932381476692…50956454734152524801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.379 × 10⁹³(94-digit number)
23792049864762953385…01912909468305049601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.758 × 10⁹³(94-digit number)
47584099729525906771…03825818936610099201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.516 × 10⁹³(94-digit number)
95168199459051813542…07651637873220198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.903 × 10⁹⁴(95-digit number)
19033639891810362708…15303275746440396801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.806 × 10⁹⁴(95-digit number)
38067279783620725417…30606551492880793601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.613 × 10⁹⁴(95-digit number)
76134559567241450834…61213102985761587201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.522 × 10⁹⁵(96-digit number)
15226911913448290166…22426205971523174401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.045 × 10⁹⁵(96-digit number)
30453823826896580333…44852411943046348801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.090 × 10⁹⁵(96-digit number)
60907647653793160667…89704823886092697601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.218 × 10⁹⁶(97-digit number)
12181529530758632133…79409647772185395201
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,718,755 XPM·at block #6,809,335 · 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