Block #2,161,197

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/15/2017, 3:21:02 AM · Difficulty 10.9013 · 4,663,838 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
df50a927e20c13902980545de78c6fc78a33d73e4058b1a4cfb05e7d2d6afab3

Height

#2,161,197

Difficulty

10.901298

Transactions

7

Size

2.90 KB

Version

2

Bits

0ae6bb72

Nonce

389,059,914

Timestamp

6/15/2017, 3:21:02 AM

Confirmations

4,663,838

Merkle Root

d24a78cd4f24d125e93b9fc6456ffc49a0d3aa2c4703dabe3c90d43f53b073b7
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.200 × 10⁹⁷(98-digit number)
12007476922226949823…51060900073919416321
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.200 × 10⁹⁷(98-digit number)
12007476922226949823…51060900073919416321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.401 × 10⁹⁷(98-digit number)
24014953844453899647…02121800147838832641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.802 × 10⁹⁷(98-digit number)
48029907688907799294…04243600295677665281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.605 × 10⁹⁷(98-digit number)
96059815377815598588…08487200591355330561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.921 × 10⁹⁸(99-digit number)
19211963075563119717…16974401182710661121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.842 × 10⁹⁸(99-digit number)
38423926151126239435…33948802365421322241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.684 × 10⁹⁸(99-digit number)
76847852302252478870…67897604730842644481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.536 × 10⁹⁹(100-digit number)
15369570460450495774…35795209461685288961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.073 × 10⁹⁹(100-digit number)
30739140920900991548…71590418923370577921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.147 × 10⁹⁹(100-digit number)
61478281841801983096…43180837846741155841
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,844,363 XPM·at block #6,825,034 · 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