Block #845,887

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2014, 4:53:50 AM · Difficulty 10.9725 · 5,993,123 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e79e9f23a69784f991e3453af0b9d9b9ef8488e22069884b61eb7dec3f1b856c

Height

#845,887

Difficulty

10.972474

Transactions

3

Size

652 B

Version

2

Bits

0af8f40c

Nonce

748,352,491

Timestamp

12/9/2014, 4:53:50 AM

Confirmations

5,993,123

Merkle Root

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

9.506 × 10⁹⁴(95-digit number)
95060213535567184448…67531963534820727041
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
9.506 × 10⁹⁴(95-digit number)
95060213535567184448…67531963534820727041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.901 × 10⁹⁵(96-digit number)
19012042707113436889…35063927069641454081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.802 × 10⁹⁵(96-digit number)
38024085414226873779…70127854139282908161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.604 × 10⁹⁵(96-digit number)
76048170828453747559…40255708278565816321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.520 × 10⁹⁶(97-digit number)
15209634165690749511…80511416557131632641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.041 × 10⁹⁶(97-digit number)
30419268331381499023…61022833114263265281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.083 × 10⁹⁶(97-digit number)
60838536662762998047…22045666228526530561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.216 × 10⁹⁷(98-digit number)
12167707332552599609…44091332457053061121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.433 × 10⁹⁷(98-digit number)
24335414665105199218…88182664914106122241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.867 × 10⁹⁷(98-digit number)
48670829330210398437…76365329828212244481
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,956,347 XPM·at block #6,839,009 · 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