Block #216,286

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/18/2013, 3:57:15 PM · Difficulty 9.9259 · 6,593,850 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c8f851708ee4990529b8fcbe076d39909a3f6913e971829a8de2e210d12e37f8

Height

#216,286

Difficulty

9.925914

Transactions

2

Size

1.29 KB

Version

2

Bits

09ed08b2

Nonce

177,126

Timestamp

10/18/2013, 3:57:15 PM

Confirmations

6,593,850

Merkle Root

b28d9c55a1848e4e42a50ceb4dd936a11c933da6a13673182b4b0ab8891d4bd3
Transactions (2)
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.

8.956 × 10⁹⁷(98-digit number)
89563470568037901678…99437630361692624001
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
8.956 × 10⁹⁷(98-digit number)
89563470568037901678…99437630361692624001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.791 × 10⁹⁸(99-digit number)
17912694113607580335…98875260723385248001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.582 × 10⁹⁸(99-digit number)
35825388227215160671…97750521446770496001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.165 × 10⁹⁸(99-digit number)
71650776454430321342…95501042893540992001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.433 × 10⁹⁹(100-digit number)
14330155290886064268…91002085787081984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.866 × 10⁹⁹(100-digit number)
28660310581772128537…82004171574163968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.732 × 10⁹⁹(100-digit number)
57320621163544257074…64008343148327936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.146 × 10¹⁰⁰(101-digit number)
11464124232708851414…28016686296655872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.292 × 10¹⁰⁰(101-digit number)
22928248465417702829…56033372593311744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.585 × 10¹⁰⁰(101-digit number)
45856496930835405659…12066745186623488001
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,725,155 XPM·at block #6,810,135 · 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