Block #2,111,586

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/11/2017, 1:51:24 PM · Difficulty 10.9028 · 4,719,806 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
007b57d712a3247a377e93733c3d1dd09428da14f95ff4d6be520467a4196b78

Height

#2,111,586

Difficulty

10.902791

Transactions

3

Size

1.50 KB

Version

2

Bits

0ae71d4f

Nonce

161,681,306

Timestamp

5/11/2017, 1:51:24 PM

Confirmations

4,719,806

Merkle Root

cc297adb9bcb064646e24ac679b4360fc2333ea622b7ab500de3ce7fa80a9190
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.812 × 10⁹⁵(96-digit number)
38125604293283643834…75495630225664931841
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.812 × 10⁹⁵(96-digit number)
38125604293283643834…75495630225664931841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.625 × 10⁹⁵(96-digit number)
76251208586567287669…50991260451329863681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.525 × 10⁹⁶(97-digit number)
15250241717313457533…01982520902659727361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.050 × 10⁹⁶(97-digit number)
30500483434626915067…03965041805319454721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.100 × 10⁹⁶(97-digit number)
61000966869253830135…07930083610638909441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.220 × 10⁹⁷(98-digit number)
12200193373850766027…15860167221277818881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.440 × 10⁹⁷(98-digit number)
24400386747701532054…31720334442555637761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.880 × 10⁹⁷(98-digit number)
48800773495403064108…63440668885111275521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.760 × 10⁹⁷(98-digit number)
97601546990806128217…26881337770222551041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.952 × 10⁹⁸(99-digit number)
19520309398161225643…53762675540445102081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.904 × 10⁹⁸(99-digit number)
39040618796322451286…07525351080890204161
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,895,292 XPM·at block #6,831,391 · 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