Block #845,576

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2014, 11:38:48 PM · Difficulty 10.9725 · 5,997,725 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c2f1e2c9efac60a6b8945ae7c9a8814830f4ac9910ea4ecb20fd02ea63d55b5c

Height

#845,576

Difficulty

10.972482

Transactions

7

Size

1.78 KB

Version

2

Bits

0af8f495

Nonce

615,169,466

Timestamp

12/8/2014, 11:38:48 PM

Confirmations

5,997,725

Merkle Root

2118061b5b97daa334850875ea12642e75e445b7d5e6a12ef4ce03a42c32354e
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.240 × 10⁹⁷(98-digit number)
32405159196025181808…69595493081895884801
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.240 × 10⁹⁷(98-digit number)
32405159196025181808…69595493081895884801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.481 × 10⁹⁷(98-digit number)
64810318392050363616…39190986163791769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.296 × 10⁹⁸(99-digit number)
12962063678410072723…78381972327583539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.592 × 10⁹⁸(99-digit number)
25924127356820145446…56763944655167078401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.184 × 10⁹⁸(99-digit number)
51848254713640290893…13527889310334156801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.036 × 10⁹⁹(100-digit number)
10369650942728058178…27055778620668313601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.073 × 10⁹⁹(100-digit number)
20739301885456116357…54111557241336627201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.147 × 10⁹⁹(100-digit number)
41478603770912232714…08223114482673254401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.295 × 10⁹⁹(100-digit number)
82957207541824465429…16446228965346508801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.659 × 10¹⁰⁰(101-digit number)
16591441508364893085…32892457930693017601
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,990,773 XPM·at block #6,843,300 · 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