Block #2,192,892

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/4/2017, 4:25:07 PM · Difficulty 10.9518 · 4,649,411 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ebd4666cb5a66389cc764a268a7beceaee815146abfa6d133e1f43d4b45bff76

Height

#2,192,892

Difficulty

10.951844

Transactions

3

Size

1.36 KB

Version

2

Bits

0af3ac05

Nonce

99,430,595

Timestamp

7/4/2017, 4:25:07 PM

Confirmations

4,649,411

Merkle Root

6fa0a8f69ad0f0a738aeb6a1d2b31ecb2dcb98ed0465bbc4a4eb236bec7f9640
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.

3.139 × 10⁹⁶(97-digit number)
31391629615572437512…12480782355807170561
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
3.139 × 10⁹⁶(97-digit number)
31391629615572437512…12480782355807170561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.278 × 10⁹⁶(97-digit number)
62783259231144875024…24961564711614341121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.255 × 10⁹⁷(98-digit number)
12556651846228975004…49923129423228682241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.511 × 10⁹⁷(98-digit number)
25113303692457950009…99846258846457364481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.022 × 10⁹⁷(98-digit number)
50226607384915900019…99692517692914728961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.004 × 10⁹⁸(99-digit number)
10045321476983180003…99385035385829457921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.009 × 10⁹⁸(99-digit number)
20090642953966360007…98770070771658915841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.018 × 10⁹⁸(99-digit number)
40181285907932720015…97540141543317831681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.036 × 10⁹⁸(99-digit number)
80362571815865440031…95080283086635663361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.607 × 10⁹⁹(100-digit number)
16072514363173088006…90160566173271326721
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,982,829 XPM·at block #6,842,302 · 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