Block #916,566

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/31/2015, 12:09:39 AM · Difficulty 10.9244 · 5,892,553 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cec8c459365718cb68f0d699d0ca5ae97caf72fd1ba8559ccc21c9bccd4c6a19

Height

#916,566

Difficulty

10.924385

Transactions

19

Size

3.77 KB

Version

2

Bits

0aeca47d

Nonce

476,673,219

Timestamp

1/31/2015, 12:09:39 AM

Confirmations

5,892,553

Merkle Root

1f1859f67cc975842e1cfa242768fac483c5387ea58d3c7e32e0ed18b1205e2a
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.784 × 10⁹⁴(95-digit number)
27849916999428684442…28805838600062134001
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.784 × 10⁹⁴(95-digit number)
27849916999428684442…28805838600062134001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.569 × 10⁹⁴(95-digit number)
55699833998857368884…57611677200124268001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.113 × 10⁹⁵(96-digit number)
11139966799771473776…15223354400248536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.227 × 10⁹⁵(96-digit number)
22279933599542947553…30446708800497072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.455 × 10⁹⁵(96-digit number)
44559867199085895107…60893417600994144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.911 × 10⁹⁵(96-digit number)
89119734398171790214…21786835201988288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.782 × 10⁹⁶(97-digit number)
17823946879634358042…43573670403976576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.564 × 10⁹⁶(97-digit number)
35647893759268716085…87147340807953152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.129 × 10⁹⁶(97-digit number)
71295787518537432171…74294681615906304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.425 × 10⁹⁷(98-digit number)
14259157503707486434…48589363231812608001
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,717,009 XPM·at block #6,809,118 · 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