Block #1,873,810

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/1/2016, 2:40:00 PM · Difficulty 10.6658 · 4,963,411 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
63ac84050837b2c2f93577d6ee6205eb860e67d7c1d5f3eeb119be6a188384dc

Height

#1,873,810

Difficulty

10.665819

Transactions

2

Size

1018 B

Version

2

Bits

0aaa7322

Nonce

739,838,011

Timestamp

12/1/2016, 2:40:00 PM

Confirmations

4,963,411

Merkle Root

d7491021dd0d34dc62fd2182bf3f2a417266433a3feec4afa7ba02e2cd25f228
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.

2.578 × 10⁹⁶(97-digit number)
25789308706580348675…78987849842781921281
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
2.578 × 10⁹⁶(97-digit number)
25789308706580348675…78987849842781921281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.157 × 10⁹⁶(97-digit number)
51578617413160697351…57975699685563842561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.031 × 10⁹⁷(98-digit number)
10315723482632139470…15951399371127685121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.063 × 10⁹⁷(98-digit number)
20631446965264278940…31902798742255370241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.126 × 10⁹⁷(98-digit number)
41262893930528557881…63805597484510740481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.252 × 10⁹⁷(98-digit number)
82525787861057115762…27611194969021480961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.650 × 10⁹⁸(99-digit number)
16505157572211423152…55222389938042961921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.301 × 10⁹⁸(99-digit number)
33010315144422846304…10444779876085923841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.602 × 10⁹⁸(99-digit number)
66020630288845692609…20889559752171847681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.320 × 10⁹⁹(100-digit number)
13204126057769138521…41779119504343695361
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,942,085 XPM·at block #6,837,220 · 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