Block #2,179,852

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/26/2017, 9:20:17 PM · Difficulty 10.9305 · 4,665,350 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ab93eab0810aa988b074ebf166440e8b7ead3d6c5fc4dd9ee3478e665cf23574

Height

#2,179,852

Difficulty

10.930498

Transactions

2

Size

722 B

Version

2

Bits

0aee351b

Nonce

1,903,968,993

Timestamp

6/26/2017, 9:20:17 PM

Confirmations

4,665,350

Merkle Root

ec0318c61febf54d486d1deb49ae71dead2dce3089f4c01d22f9bb8202607a6a
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.089 × 10⁹⁴(95-digit number)
10897320133145502781…21265262498544725121
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.089 × 10⁹⁴(95-digit number)
10897320133145502781…21265262498544725121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.179 × 10⁹⁴(95-digit number)
21794640266291005563…42530524997089450241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.358 × 10⁹⁴(95-digit number)
43589280532582011126…85061049994178900481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.717 × 10⁹⁴(95-digit number)
87178561065164022252…70122099988357800961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.743 × 10⁹⁵(96-digit number)
17435712213032804450…40244199976715601921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.487 × 10⁹⁵(96-digit number)
34871424426065608900…80488399953431203841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.974 × 10⁹⁵(96-digit number)
69742848852131217801…60976799906862407681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.394 × 10⁹⁶(97-digit number)
13948569770426243560…21953599813724815361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.789 × 10⁹⁶(97-digit number)
27897139540852487120…43907199627449630721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.579 × 10⁹⁶(97-digit number)
55794279081704974241…87814399254899261441
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:58,006,049 XPM·at block #6,845,201 · 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