Block #843,539

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2014, 11:16:23 AM · Difficulty 10.9732 · 5,968,762 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
615bf2a2e805666c23be107e046667a33841d225f572e673fa03aedad3efe1fe

Height

#843,539

Difficulty

10.973209

Transactions

7

Size

1.52 KB

Version

2

Bits

0af9243c

Nonce

265,974,110

Timestamp

12/7/2014, 11:16:23 AM

Confirmations

5,968,762

Merkle Root

4b80a967ce5229ab18f99158c9d04b014a7689da021e2c32357cd9fa440cee79
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.814 × 10⁹³(94-digit number)
18142260303356378936…53110204865530973761
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.814 × 10⁹³(94-digit number)
18142260303356378936…53110204865530973761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.628 × 10⁹³(94-digit number)
36284520606712757872…06220409731061947521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.256 × 10⁹³(94-digit number)
72569041213425515745…12440819462123895041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.451 × 10⁹⁴(95-digit number)
14513808242685103149…24881638924247790081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.902 × 10⁹⁴(95-digit number)
29027616485370206298…49763277848495580161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.805 × 10⁹⁴(95-digit number)
58055232970740412596…99526555696991160321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.161 × 10⁹⁵(96-digit number)
11611046594148082519…99053111393982320641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.322 × 10⁹⁵(96-digit number)
23222093188296165038…98106222787964641281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.644 × 10⁹⁵(96-digit number)
46444186376592330077…96212445575929282561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.288 × 10⁹⁵(96-digit number)
92888372753184660154…92424891151858565121
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,742,428 XPM·at block #6,812,300 · 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