Block #2,190,366

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/3/2017, 2:12:02 AM · Difficulty 10.9495 · 4,636,192 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fd4ae72042e464a21d1064c331f685c782efac5ac99b2556c576c7ef66e9a289

Height

#2,190,366

Difficulty

10.949538

Transactions

3

Size

992 B

Version

2

Bits

0af314e9

Nonce

138,571,155

Timestamp

7/3/2017, 2:12:02 AM

Confirmations

4,636,192

Merkle Root

68993d9144ec7014a62274e6b95d8ce553050e5a4a66acf974ff451443fd25c7
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.

1.867 × 10⁹⁵(96-digit number)
18673006627289900731…76309231802777568161
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.867 × 10⁹⁵(96-digit number)
18673006627289900731…76309231802777568161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.734 × 10⁹⁵(96-digit number)
37346013254579801462…52618463605555136321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.469 × 10⁹⁵(96-digit number)
74692026509159602925…05236927211110272641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.493 × 10⁹⁶(97-digit number)
14938405301831920585…10473854422220545281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.987 × 10⁹⁶(97-digit number)
29876810603663841170…20947708844441090561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.975 × 10⁹⁶(97-digit number)
59753621207327682340…41895417688882181121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.195 × 10⁹⁷(98-digit number)
11950724241465536468…83790835377764362241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.390 × 10⁹⁷(98-digit number)
23901448482931072936…67581670755528724481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.780 × 10⁹⁷(98-digit number)
47802896965862145872…35163341511057448961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.560 × 10⁹⁷(98-digit number)
95605793931724291744…70326683022114897921
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,856,615 XPM·at block #6,826,557 · 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