Block #852,616

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2014, 6:12:46 AM · Difficulty 10.9695 · 5,989,682 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9ac2deb021848d77fd87dd835308abd7c5a4cffa091ab7821c7e43911125a2dd

Height

#852,616

Difficulty

10.969518

Transactions

6

Size

1.27 KB

Version

2

Bits

0af8325b

Nonce

1,572,107,457

Timestamp

12/14/2014, 6:12:46 AM

Confirmations

5,989,682

Merkle Root

9c41000de19b06fe45aa5b677cf53eb83544b8cd4150676bfb67969019ba9676
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.

7.616 × 10⁹⁴(95-digit number)
76169521282688930874…26381940102152909441
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
7.616 × 10⁹⁴(95-digit number)
76169521282688930874…26381940102152909441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.523 × 10⁹⁵(96-digit number)
15233904256537786174…52763880204305818881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.046 × 10⁹⁵(96-digit number)
30467808513075572349…05527760408611637761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.093 × 10⁹⁵(96-digit number)
60935617026151144699…11055520817223275521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.218 × 10⁹⁶(97-digit number)
12187123405230228939…22111041634446551041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.437 × 10⁹⁶(97-digit number)
24374246810460457879…44222083268893102081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.874 × 10⁹⁶(97-digit number)
48748493620920915759…88444166537786204161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.749 × 10⁹⁶(97-digit number)
97496987241841831519…76888333075572408321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.949 × 10⁹⁷(98-digit number)
19499397448368366303…53776666151144816641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.899 × 10⁹⁷(98-digit number)
38998794896736732607…07553332302289633281
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,982,788 XPM·at block #6,842,297 · 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