Block #2,114,415

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/13/2017, 3:29:40 PM · Difficulty 10.9000 · 4,717,255 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
50fc6fe947eb7f8d2fbe0e7ebcfffd5ce93ef95e4ffa7869dd2ee2b8c63759ac

Height

#2,114,415

Difficulty

10.899970

Transactions

2

Size

2.01 KB

Version

2

Bits

0ae66471

Nonce

176,000,423

Timestamp

5/13/2017, 3:29:40 PM

Confirmations

4,717,255

Merkle Root

6c3e49537d9fa75c40f5bac79d18042a429d52e6c663a49e798c4924e3ad59ae
Transactions (2)
1 in → 1 out8.4300 XPM110 B
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.207 × 10⁹²(93-digit number)
12071184857524406518…99674573340435153719
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.207 × 10⁹²(93-digit number)
12071184857524406518…99674573340435153719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.414 × 10⁹²(93-digit number)
24142369715048813037…99349146680870307439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.828 × 10⁹²(93-digit number)
48284739430097626074…98698293361740614879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.656 × 10⁹²(93-digit number)
96569478860195252148…97396586723481229759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.931 × 10⁹³(94-digit number)
19313895772039050429…94793173446962459519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.862 × 10⁹³(94-digit number)
38627791544078100859…89586346893924919039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.725 × 10⁹³(94-digit number)
77255583088156201718…79172693787849838079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.545 × 10⁹⁴(95-digit number)
15451116617631240343…58345387575699676159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.090 × 10⁹⁴(95-digit number)
30902233235262480687…16690775151399352319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.180 × 10⁹⁴(95-digit number)
61804466470524961375…33381550302798704639
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,897,465 XPM·at block #6,831,669 · 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