Block #858,290

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2014, 12:12:00 PM · Difficulty 10.9669 · 5,975,690 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0adb7182db9e45c42982c5b1438ca1aa617e0703485fa9f54254f1c1dc1d402f

Height

#858,290

Difficulty

10.966893

Transactions

11

Size

2.81 KB

Version

2

Bits

0af78647

Nonce

772,940,398

Timestamp

12/18/2014, 12:12:00 PM

Confirmations

5,975,690

Merkle Root

fe9b500b8a9ded5c0798115746860b943c8be3ca6c87f906b211f47795127353
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.671 × 10⁹⁷(98-digit number)
46714173907697545416…41407186553302200321
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.671 × 10⁹⁷(98-digit number)
46714173907697545416…41407186553302200321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.342 × 10⁹⁷(98-digit number)
93428347815395090832…82814373106604400641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.868 × 10⁹⁸(99-digit number)
18685669563079018166…65628746213208801281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.737 × 10⁹⁸(99-digit number)
37371339126158036333…31257492426417602561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.474 × 10⁹⁸(99-digit number)
74742678252316072666…62514984852835205121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.494 × 10⁹⁹(100-digit number)
14948535650463214533…25029969705670410241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.989 × 10⁹⁹(100-digit number)
29897071300926429066…50059939411340820481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.979 × 10⁹⁹(100-digit number)
59794142601852858133…00119878822681640961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.195 × 10¹⁰⁰(101-digit number)
11958828520370571626…00239757645363281921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.391 × 10¹⁰⁰(101-digit number)
23917657040741143253…00479515290726563841
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,916,065 XPM·at block #6,833,979 · 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