Block #844,192

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2014, 10:59:01 PM · Difficulty 10.9730 · 5,989,621 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9320eae1e9b368bfebc9e2646c30698226590d5ae840b43a677cd347e936c09f

Height

#844,192

Difficulty

10.972966

Transactions

9

Size

5.58 KB

Version

2

Bits

0af9144b

Nonce

865,082,103

Timestamp

12/7/2014, 10:59:01 PM

Confirmations

5,989,621

Merkle Root

83b432de38801b5f9368aacfe53c56dc5fea1954819a956aa16b7b4ab37b6aab
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.313 × 10⁹⁵(96-digit number)
43133282532913892087…17541650141571518401
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.313 × 10⁹⁵(96-digit number)
43133282532913892087…17541650141571518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.626 × 10⁹⁵(96-digit number)
86266565065827784175…35083300283143036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.725 × 10⁹⁶(97-digit number)
17253313013165556835…70166600566286073601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.450 × 10⁹⁶(97-digit number)
34506626026331113670…40333201132572147201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.901 × 10⁹⁶(97-digit number)
69013252052662227340…80666402265144294401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.380 × 10⁹⁷(98-digit number)
13802650410532445468…61332804530288588801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.760 × 10⁹⁷(98-digit number)
27605300821064890936…22665609060577177601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.521 × 10⁹⁷(98-digit number)
55210601642129781872…45331218121154355201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.104 × 10⁹⁸(99-digit number)
11042120328425956374…90662436242308710401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.208 × 10⁹⁸(99-digit number)
22084240656851912748…81324872484617420801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.416 × 10⁹⁸(99-digit number)
44168481313703825497…62649744969234841601
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,914,728 XPM·at block #6,833,812 · 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