Block #2,182,195

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/28/2017, 3:04:03 AM · Difficulty 10.9379 · 4,627,732 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c65b3ce3ab8d9dc4df630e048e7cb1046eab4e1304fb1b48d4bab3e20fe56fa5

Height

#2,182,195

Difficulty

10.937857

Transactions

41

Size

12.18 KB

Version

2

Bits

0af0175f

Nonce

1,138,374,185

Timestamp

6/28/2017, 3:04:03 AM

Confirmations

4,627,732

Merkle Root

be667eb251ec6bb6a161c5cabb7e5e78be87c13fc22c7d5615cc24a85b059169
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.338 × 10⁹⁴(95-digit number)
13380903959470020276…02029295062765403521
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.338 × 10⁹⁴(95-digit number)
13380903959470020276…02029295062765403521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.676 × 10⁹⁴(95-digit number)
26761807918940040553…04058590125530807041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.352 × 10⁹⁴(95-digit number)
53523615837880081107…08117180251061614081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.070 × 10⁹⁵(96-digit number)
10704723167576016221…16234360502123228161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.140 × 10⁹⁵(96-digit number)
21409446335152032443…32468721004246456321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.281 × 10⁹⁵(96-digit number)
42818892670304064886…64937442008492912641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.563 × 10⁹⁵(96-digit number)
85637785340608129772…29874884016985825281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.712 × 10⁹⁶(97-digit number)
17127557068121625954…59749768033971650561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.425 × 10⁹⁶(97-digit number)
34255114136243251909…19499536067943301121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.851 × 10⁹⁶(97-digit number)
68510228272486503818…38999072135886602241
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,723,502 XPM·at block #6,809,926 · 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.

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