Block #211,610

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/15/2013, 7:26:02 PM · Difficulty 9.9168 · 6,599,510 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b17e48cab6019ace3fc41e1c6d4bf37fede54a36f48ccad04660ba69e2ab355d

Height

#211,610

Difficulty

9.916834

Transactions

2

Size

394 B

Version

2

Bits

09eab5a1

Nonce

139,975

Timestamp

10/15/2013, 7:26:02 PM

Confirmations

6,599,510

Merkle Root

30691ee60ae435fe601d98adce1c279bb52d3228cc79e6e33906a62aef9775ab
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.

1.387 × 10⁹⁶(97-digit number)
13878536172128056886…11443522935587324801
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.387 × 10⁹⁶(97-digit number)
13878536172128056886…11443522935587324801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.775 × 10⁹⁶(97-digit number)
27757072344256113772…22887045871174649601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.551 × 10⁹⁶(97-digit number)
55514144688512227544…45774091742349299201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.110 × 10⁹⁷(98-digit number)
11102828937702445508…91548183484698598401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.220 × 10⁹⁷(98-digit number)
22205657875404891017…83096366969397196801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.441 × 10⁹⁷(98-digit number)
44411315750809782035…66192733938794393601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.882 × 10⁹⁷(98-digit number)
88822631501619564071…32385467877588787201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.776 × 10⁹⁸(99-digit number)
17764526300323912814…64770935755177574401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.552 × 10⁹⁸(99-digit number)
35529052600647825628…29541871510355148801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.105 × 10⁹⁸(99-digit number)
71058105201295651257…59083743020710297601
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,733,069 XPM·at block #6,811,119 · 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