Block #856,817

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2014, 9:14:13 AM · Difficulty 10.9678 · 5,952,803 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
70fec2d6e8019d1402756b2a231eb3ecef18aed039fd3fdad02fa1e1fd7f9e36

Height

#856,817

Difficulty

10.967821

Transactions

17

Size

4.74 KB

Version

2

Bits

0af7c325

Nonce

8,708,009

Timestamp

12/17/2014, 9:14:13 AM

Confirmations

5,952,803

Merkle Root

bfcfe2ab62a362baf6e1647462cee88d1b9eb077df80b1804b27479f0a63e56e
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.437 × 10⁹⁶(97-digit number)
14372061617978311410…05549116607745425441
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.437 × 10⁹⁶(97-digit number)
14372061617978311410…05549116607745425441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.874 × 10⁹⁶(97-digit number)
28744123235956622821…11098233215490850881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.748 × 10⁹⁶(97-digit number)
57488246471913245643…22196466430981701761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.149 × 10⁹⁷(98-digit number)
11497649294382649128…44392932861963403521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.299 × 10⁹⁷(98-digit number)
22995298588765298257…88785865723926807041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.599 × 10⁹⁷(98-digit number)
45990597177530596514…77571731447853614081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.198 × 10⁹⁷(98-digit number)
91981194355061193029…55143462895707228161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.839 × 10⁹⁸(99-digit number)
18396238871012238605…10286925791414456321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.679 × 10⁹⁸(99-digit number)
36792477742024477211…20573851582828912641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.358 × 10⁹⁸(99-digit number)
73584955484048954423…41147703165657825281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.471 × 10⁹⁹(100-digit number)
14716991096809790884…82295406331315650561
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,721,037 XPM·at block #6,809,619 · 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