Block #2,114,406

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/13/2017, 3:21:51 PM · Difficulty 10.8999 · 4,700,546 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c3b5ac2fa1e91d9da4ad91f0e0789350ed4f721920972feaa3284d14022cf9ba

Height

#2,114,406

Difficulty

10.899947

Transactions

3

Size

1.86 KB

Version

2

Bits

0ae662f4

Nonce

655,936,422

Timestamp

5/13/2017, 3:21:51 PM

Confirmations

4,700,546

Merkle Root

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

9.892 × 10⁹⁴(95-digit number)
98924849116678304998…90229698548370029201
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
9.892 × 10⁹⁴(95-digit number)
98924849116678304998…90229698548370029201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.978 × 10⁹⁵(96-digit number)
19784969823335660999…80459397096740058401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.956 × 10⁹⁵(96-digit number)
39569939646671321999…60918794193480116801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.913 × 10⁹⁵(96-digit number)
79139879293342643999…21837588386960233601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.582 × 10⁹⁶(97-digit number)
15827975858668528799…43675176773920467201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.165 × 10⁹⁶(97-digit number)
31655951717337057599…87350353547840934401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.331 × 10⁹⁶(97-digit number)
63311903434674115199…74700707095681868801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.266 × 10⁹⁷(98-digit number)
12662380686934823039…49401414191363737601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.532 × 10⁹⁷(98-digit number)
25324761373869646079…98802828382727475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.064 × 10⁹⁷(98-digit number)
50649522747739292159…97605656765454950401
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,763,713 XPM·at block #6,814,951 · 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