Block #654,116

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/30/2014, 12:00:36 AM · Difficulty 10.9552 · 6,140,528 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
18b1e52b1266b3b000048cabf1fe1ecb1b1b24e58035299e4cdc81ec5a0c8d07

Height

#654,116

Difficulty

10.955172

Transactions

3

Size

100.81 KB

Version

2

Bits

0af48625

Nonce

397,051,855

Timestamp

7/30/2014, 12:00:36 AM

Confirmations

6,140,528

Merkle Root

1dc53e64c821f4e56f40f597b92a170c86f47395049301d7869b206e2a21d1c2
Transactions (3)
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.

5.605 × 10⁹⁷(98-digit number)
56054343782654067627…44070232291490324481
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
5.605 × 10⁹⁷(98-digit number)
56054343782654067627…44070232291490324481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.121 × 10⁹⁸(99-digit number)
11210868756530813525…88140464582980648961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.242 × 10⁹⁸(99-digit number)
22421737513061627051…76280929165961297921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.484 × 10⁹⁸(99-digit number)
44843475026123254102…52561858331922595841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.968 × 10⁹⁸(99-digit number)
89686950052246508204…05123716663845191681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.793 × 10⁹⁹(100-digit number)
17937390010449301640…10247433327690383361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.587 × 10⁹⁹(100-digit number)
35874780020898603281…20494866655380766721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.174 × 10⁹⁹(100-digit number)
71749560041797206563…40989733310761533441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.434 × 10¹⁰⁰(101-digit number)
14349912008359441312…81979466621523066881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.869 × 10¹⁰⁰(101-digit number)
28699824016718882625…63958933243046133761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.739 × 10¹⁰⁰(101-digit number)
57399648033437765250…27917866486092267521
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,601,200 XPM·at block #6,794,643 · 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.