Block #2,212,108

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/18/2017, 2:10:05 PM · Difficulty 10.9441 · 4,614,112 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6c3f81d46ff0f73260c85221582380187572409ab530eccadad5d12aa25f5d72

Height

#2,212,108

Difficulty

10.944122

Transactions

6

Size

1.70 KB

Version

2

Bits

0af1b1fa

Nonce

1,613,594,509

Timestamp

7/18/2017, 2:10:05 PM

Confirmations

4,614,112

Merkle Root

bc655da9a97bedff8ee317d301e592b5796973514aca9e73ce6e9e90a6391177
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.823 × 10⁹⁴(95-digit number)
18235620334067155212…95898270936992459361
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.823 × 10⁹⁴(95-digit number)
18235620334067155212…95898270936992459361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.647 × 10⁹⁴(95-digit number)
36471240668134310424…91796541873984918721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.294 × 10⁹⁴(95-digit number)
72942481336268620848…83593083747969837441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.458 × 10⁹⁵(96-digit number)
14588496267253724169…67186167495939674881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.917 × 10⁹⁵(96-digit number)
29176992534507448339…34372334991879349761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.835 × 10⁹⁵(96-digit number)
58353985069014896678…68744669983758699521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.167 × 10⁹⁶(97-digit number)
11670797013802979335…37489339967517399041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.334 × 10⁹⁶(97-digit number)
23341594027605958671…74978679935034798081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.668 × 10⁹⁶(97-digit number)
46683188055211917342…49957359870069596161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.336 × 10⁹⁶(97-digit number)
93366376110423834685…99914719740139192321
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,853,893 XPM·at block #6,826,219 · 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.
Privacy Policy·

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