Block #2,152,797

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/9/2017, 6:24:46 AM · Difficulty 10.9021 · 4,690,061 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
26a50f6c6c7d51a3c64a8c759252356d103bd72a6ef4701940aadd1011edc0d0

Height

#2,152,797

Difficulty

10.902094

Transactions

2

Size

427 B

Version

2

Bits

0ae6ef9e

Nonce

1,142,294,454

Timestamp

6/9/2017, 6:24:46 AM

Confirmations

4,690,061

Merkle Root

a67155c03d6f3482778db452dd23145fa2fe3392b1e970aa99524b6f7f8bd00f
Transactions (2)
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.757 × 10⁹⁵(96-digit number)
17572297595870618044…29475253752908049921
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.757 × 10⁹⁵(96-digit number)
17572297595870618044…29475253752908049921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.514 × 10⁹⁵(96-digit number)
35144595191741236089…58950507505816099841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.028 × 10⁹⁵(96-digit number)
70289190383482472178…17901015011632199681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.405 × 10⁹⁶(97-digit number)
14057838076696494435…35802030023264399361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.811 × 10⁹⁶(97-digit number)
28115676153392988871…71604060046528798721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.623 × 10⁹⁶(97-digit number)
56231352306785977743…43208120093057597441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.124 × 10⁹⁷(98-digit number)
11246270461357195548…86416240186115194881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.249 × 10⁹⁷(98-digit number)
22492540922714391097…72832480372230389761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.498 × 10⁹⁷(98-digit number)
44985081845428782194…45664960744460779521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.997 × 10⁹⁷(98-digit number)
89970163690857564389…91329921488921559041
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,987,211 XPM·at block #6,842,857 · 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