Block #1,938,487

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/14/2017, 5:43:38 AM · Difficulty 10.7707 · 4,878,704 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d0c88521e95601a4f25b9008ce2e7b89b73c5f6ec52a0cd7bd1090271fba86c9

Height

#1,938,487

Difficulty

10.770743

Transactions

2

Size

3.17 KB

Version

2

Bits

0ac54f6d

Nonce

1,650,701,562

Timestamp

1/14/2017, 5:43:38 AM

Confirmations

4,878,704

Merkle Root

0b59449825d300418b9efb2fc0adf445d452892d5e86f99337ef7f0f8cb1a4d2
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.249 × 10⁹⁶(97-digit number)
22490196697630709414…54165763488010158081
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.249 × 10⁹⁶(97-digit number)
22490196697630709414…54165763488010158081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.498 × 10⁹⁶(97-digit number)
44980393395261418829…08331526976020316161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.996 × 10⁹⁶(97-digit number)
89960786790522837658…16663053952040632321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.799 × 10⁹⁷(98-digit number)
17992157358104567531…33326107904081264641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.598 × 10⁹⁷(98-digit number)
35984314716209135063…66652215808162529281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.196 × 10⁹⁷(98-digit number)
71968629432418270126…33304431616325058561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.439 × 10⁹⁸(99-digit number)
14393725886483654025…66608863232650117121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.878 × 10⁹⁸(99-digit number)
28787451772967308050…33217726465300234241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.757 × 10⁹⁸(99-digit number)
57574903545934616101…66435452930600468481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.151 × 10⁹⁹(100-digit number)
11514980709186923220…32870905861200936961
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,781,564 XPM·at block #6,817,190 · 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