Block #858,457

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2014, 3:30:38 PM · Difficulty 10.9667 · 5,981,857 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d54f4aa0e0729b6c21903f5dc29a1b8850a8b767f8e514355bf8ae812a6f9674

Height

#858,457

Difficulty

10.966719

Transactions

12

Size

3.96 KB

Version

2

Bits

0af77ae2

Nonce

685,225,881

Timestamp

12/18/2014, 3:30:38 PM

Confirmations

5,981,857

Merkle Root

6450835bd661197d13c2f99e9064db8639cd067ee4c1f9f40269287d30c6df94
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.

3.283 × 10⁹⁷(98-digit number)
32834685534665269641…92849356447839600641
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
3.283 × 10⁹⁷(98-digit number)
32834685534665269641…92849356447839600641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.566 × 10⁹⁷(98-digit number)
65669371069330539282…85698712895679201281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.313 × 10⁹⁸(99-digit number)
13133874213866107856…71397425791358402561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.626 × 10⁹⁸(99-digit number)
26267748427732215712…42794851582716805121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.253 × 10⁹⁸(99-digit number)
52535496855464431425…85589703165433610241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.050 × 10⁹⁹(100-digit number)
10507099371092886285…71179406330867220481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.101 × 10⁹⁹(100-digit number)
21014198742185772570…42358812661734440961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.202 × 10⁹⁹(100-digit number)
42028397484371545140…84717625323468881921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.405 × 10⁹⁹(100-digit number)
84056794968743090281…69435250646937763841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.681 × 10¹⁰⁰(101-digit number)
16811358993748618056…38870501293875527681
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,966,831 XPM·at block #6,840,313 · 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