Block #846,186

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2014, 10:27:54 AM · Difficulty 10.9723 · 5,997,355 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
41af69397b39ff2fe264b9d7e5ac048269b5a9a8c0bff87123befed5f80ec5ae

Height

#846,186

Difficulty

10.972296

Transactions

12

Size

2.53 KB

Version

2

Bits

0af8e863

Nonce

399,135,053

Timestamp

12/9/2014, 10:27:54 AM

Confirmations

5,997,355

Merkle Root

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

4.569 × 10⁹⁵(96-digit number)
45695998715474500957…70795508597701478401
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
4.569 × 10⁹⁵(96-digit number)
45695998715474500957…70795508597701478401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.139 × 10⁹⁵(96-digit number)
91391997430949001915…41591017195402956801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.827 × 10⁹⁶(97-digit number)
18278399486189800383…83182034390805913601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.655 × 10⁹⁶(97-digit number)
36556798972379600766…66364068781611827201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.311 × 10⁹⁶(97-digit number)
73113597944759201532…32728137563223654401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.462 × 10⁹⁷(98-digit number)
14622719588951840306…65456275126447308801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.924 × 10⁹⁷(98-digit number)
29245439177903680612…30912550252894617601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.849 × 10⁹⁷(98-digit number)
58490878355807361225…61825100505789235201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.169 × 10⁹⁸(99-digit number)
11698175671161472245…23650201011578470401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.339 × 10⁹⁸(99-digit number)
23396351342322944490…47300402023156940801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.679 × 10⁹⁸(99-digit number)
46792702684645888980…94600804046313881601
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,992,703 XPM·at block #6,843,540 · 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