Block #2,191,143

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/3/2017, 1:41:13 PM · Difficulty 10.9504 · 4,647,794 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
129a1ce4c44d97b4b395660771d576e9bc0203ea6727269c94749c96705de02e

Height

#2,191,143

Difficulty

10.950386

Transactions

18

Size

4.78 KB

Version

2

Bits

0af34c84

Nonce

1,251,011,029

Timestamp

7/3/2017, 1:41:13 PM

Confirmations

4,647,794

Merkle Root

1d63a4e22ad8c646a5df1625f211a550d0f62869206eecf5499a9c63c76b682d
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.132 × 10⁹³(94-digit number)
11328060228615346523…24415072325777962881
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.132 × 10⁹³(94-digit number)
11328060228615346523…24415072325777962881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.265 × 10⁹³(94-digit number)
22656120457230693047…48830144651555925761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.531 × 10⁹³(94-digit number)
45312240914461386095…97660289303111851521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.062 × 10⁹³(94-digit number)
90624481828922772191…95320578606223703041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.812 × 10⁹⁴(95-digit number)
18124896365784554438…90641157212447406081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.624 × 10⁹⁴(95-digit number)
36249792731569108876…81282314424894812161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.249 × 10⁹⁴(95-digit number)
72499585463138217753…62564628849789624321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.449 × 10⁹⁵(96-digit number)
14499917092627643550…25129257699579248641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.899 × 10⁹⁵(96-digit number)
28999834185255287101…50258515399158497281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.799 × 10⁹⁵(96-digit number)
57999668370510574202…00517030798316994561
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,955,760 XPM·at block #6,838,936 · 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