Block #856,274

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2014, 11:05:30 PM · Difficulty 10.9682 · 5,952,374 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
50bc41dc7ca21751de3142365b47b82993025be9750ec5c1941808975bef0f61

Height

#856,274

Difficulty

10.968182

Transactions

5

Size

1.51 KB

Version

2

Bits

0af7dacb

Nonce

215,992,364

Timestamp

12/16/2014, 11:05:30 PM

Confirmations

5,952,374

Merkle Root

3b1167292e5dbe32f11f68d96637677e122e4896fcb1c4b0654ac5d6e6c02ddb
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.526 × 10⁹³(94-digit number)
15263691118729834771…58560798087699969621
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.526 × 10⁹³(94-digit number)
15263691118729834771…58560798087699969621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.052 × 10⁹³(94-digit number)
30527382237459669543…17121596175399939241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.105 × 10⁹³(94-digit number)
61054764474919339087…34243192350799878481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.221 × 10⁹⁴(95-digit number)
12210952894983867817…68486384701599756961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.442 × 10⁹⁴(95-digit number)
24421905789967735634…36972769403199513921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.884 × 10⁹⁴(95-digit number)
48843811579935471269…73945538806399027841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.768 × 10⁹⁴(95-digit number)
97687623159870942539…47891077612798055681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.953 × 10⁹⁵(96-digit number)
19537524631974188507…95782155225596111361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.907 × 10⁹⁵(96-digit number)
39075049263948377015…91564310451192222721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.815 × 10⁹⁵(96-digit number)
78150098527896754031…83128620902384445441
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,713,237 XPM·at block #6,808,647 · 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