Block #857,255

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2014, 5:08:06 PM · Difficulty 10.9676 · 5,988,136 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
624f12b3223cd61d2d934aaca43b8a326829868e53c5aed535208a59edf6ef1b

Height

#857,255

Difficulty

10.967562

Transactions

21

Size

4.63 KB

Version

2

Bits

0af7b223

Nonce

476,164,650

Timestamp

12/17/2014, 5:08:06 PM

Confirmations

5,988,136

Merkle Root

7212b5942d828ea7dd1bc771dcb5973d478d7df984a1480f6ebdb654fc3dc780
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.036 × 10⁹⁵(96-digit number)
70363639212678991627…08014700975439144001
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.036 × 10⁹⁵(96-digit number)
70363639212678991627…08014700975439144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.407 × 10⁹⁶(97-digit number)
14072727842535798325…16029401950878288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.814 × 10⁹⁶(97-digit number)
28145455685071596651…32058803901756576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.629 × 10⁹⁶(97-digit number)
56290911370143193302…64117607803513152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.125 × 10⁹⁷(98-digit number)
11258182274028638660…28235215607026304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.251 × 10⁹⁷(98-digit number)
22516364548057277320…56470431214052608001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.503 × 10⁹⁷(98-digit number)
45032729096114554641…12940862428105216001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.006 × 10⁹⁷(98-digit number)
90065458192229109283…25881724856210432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.801 × 10⁹⁸(99-digit number)
18013091638445821856…51763449712420864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.602 × 10⁹⁸(99-digit number)
36026183276891643713…03526899424841728001
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:58,007,574 XPM·at block #6,845,390 · 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