Block #2,091,584

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/28/2017, 3:06:08 PM · Difficulty 10.8721 · 4,717,202 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
51de30553efe602e9012e6b04d7f015c9f0c36dc8fe296e972de85d302fc2266

Height

#2,091,584

Difficulty

10.872105

Transactions

3

Size

2.63 KB

Version

2

Bits

0adf423e

Nonce

1,103,259,721

Timestamp

4/28/2017, 3:06:08 PM

Confirmations

4,717,202

Merkle Root

d79545ad70cf02675b84279429b87c35e3d61022dbbed753cb5a665fc93eca44
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.442 × 10⁹⁴(95-digit number)
14425548245473454924…75056482160474223881
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.442 × 10⁹⁴(95-digit number)
14425548245473454924…75056482160474223881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.885 × 10⁹⁴(95-digit number)
28851096490946909848…50112964320948447761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.770 × 10⁹⁴(95-digit number)
57702192981893819697…00225928641896895521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.154 × 10⁹⁵(96-digit number)
11540438596378763939…00451857283793791041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.308 × 10⁹⁵(96-digit number)
23080877192757527878…00903714567587582081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.616 × 10⁹⁵(96-digit number)
46161754385515055757…01807429135175164161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.232 × 10⁹⁵(96-digit number)
92323508771030111515…03614858270350328321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.846 × 10⁹⁶(97-digit number)
18464701754206022303…07229716540700656641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.692 × 10⁹⁶(97-digit number)
36929403508412044606…14459433081401313281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.385 × 10⁹⁶(97-digit number)
73858807016824089212…28918866162802626561
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,714,339 XPM·at block #6,808,785 · 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.

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