Block #2,086,970

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/25/2017, 9:03:28 AM · Difficulty 10.8737 · 4,755,307 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5ce5b362a75471382af64afed27175605b12baecd058c5e460ebaf497dbb373c

Height

#2,086,970

Difficulty

10.873706

Transactions

2

Size

2.87 KB

Version

2

Bits

0adfab2b

Nonce

1,694,399,649

Timestamp

4/25/2017, 9:03:28 AM

Confirmations

4,755,307

Merkle Root

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

6.494 × 10⁹³(94-digit number)
64949788687170725764…44079193222582261621
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
6.494 × 10⁹³(94-digit number)
64949788687170725764…44079193222582261621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.298 × 10⁹⁴(95-digit number)
12989957737434145152…88158386445164523241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.597 × 10⁹⁴(95-digit number)
25979915474868290305…76316772890329046481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.195 × 10⁹⁴(95-digit number)
51959830949736580611…52633545780658092961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.039 × 10⁹⁵(96-digit number)
10391966189947316122…05267091561316185921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.078 × 10⁹⁵(96-digit number)
20783932379894632244…10534183122632371841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.156 × 10⁹⁵(96-digit number)
41567864759789264488…21068366245264743681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.313 × 10⁹⁵(96-digit number)
83135729519578528977…42136732490529487361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.662 × 10⁹⁶(97-digit number)
16627145903915705795…84273464981058974721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.325 × 10⁹⁶(97-digit number)
33254291807831411591…68546929962117949441
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,982,617 XPM·at block #6,842,276 · 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