Block #865,107

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/23/2014, 4:32:09 PM · Difficulty 10.9626 · 5,947,528 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8dfa47be3dc7b864bc39af74f00d3f6a22aed7f274f5bc80e2793fefaef7a390

Height

#865,107

Difficulty

10.962600

Transactions

5

Size

1.08 KB

Version

2

Bits

0af66cfb

Nonce

1,603,410,562

Timestamp

12/23/2014, 4:32:09 PM

Confirmations

5,947,528

Merkle Root

241dad3b0b284335d1149d4f99932737eb98c472e434f797eef0e437cd144a55
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.

2.762 × 10⁹⁴(95-digit number)
27625449440459805589…31013280631000363071
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
2.762 × 10⁹⁴(95-digit number)
27625449440459805589…31013280631000363071
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.525 × 10⁹⁴(95-digit number)
55250898880919611179…62026561262000726141
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.105 × 10⁹⁵(96-digit number)
11050179776183922235…24053122524001452281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.210 × 10⁹⁵(96-digit number)
22100359552367844471…48106245048002904561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.420 × 10⁹⁵(96-digit number)
44200719104735688943…96212490096005809121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.840 × 10⁹⁵(96-digit number)
88401438209471377887…92424980192011618241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.768 × 10⁹⁶(97-digit number)
17680287641894275577…84849960384023236481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.536 × 10⁹⁶(97-digit number)
35360575283788551154…69699920768046472961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.072 × 10⁹⁶(97-digit number)
70721150567577102309…39399841536092945921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.414 × 10⁹⁷(98-digit number)
14144230113515420461…78799683072185891841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.828 × 10⁹⁷(98-digit number)
28288460227030840923…57599366144371783681
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,745,116 XPM·at block #6,812,634 · 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