Block #843,113

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2014, 3:58:26 AM · Difficulty 10.9733 · 5,984,194 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ee4bdd8c3fd2df42ba4d76254f780c166ea74d23e1aa2caca6a0ad1750ae1712

Height

#843,113

Difficulty

10.973263

Transactions

12

Size

2.74 KB

Version

2

Bits

0af927c4

Nonce

1,582,955,059

Timestamp

12/7/2014, 3:58:26 AM

Confirmations

5,984,194

Merkle Root

0f17a670d8295d57058c587199f76ea8a543a8eaf779d813930c64028bbeae0e
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.

6.473 × 10⁹⁵(96-digit number)
64736881600367637659…87386714205705585041
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
6.473 × 10⁹⁵(96-digit number)
64736881600367637659…87386714205705585041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.294 × 10⁹⁶(97-digit number)
12947376320073527531…74773428411411170081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.589 × 10⁹⁶(97-digit number)
25894752640147055063…49546856822822340161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.178 × 10⁹⁶(97-digit number)
51789505280294110127…99093713645644680321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.035 × 10⁹⁷(98-digit number)
10357901056058822025…98187427291289360641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.071 × 10⁹⁷(98-digit number)
20715802112117644051…96374854582578721281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.143 × 10⁹⁷(98-digit number)
41431604224235288102…92749709165157442561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.286 × 10⁹⁷(98-digit number)
82863208448470576204…85499418330314885121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.657 × 10⁹⁸(99-digit number)
16572641689694115240…70998836660629770241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.314 × 10⁹⁸(99-digit number)
33145283379388230481…41997673321259540481
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,862,568 XPM·at block #6,827,306 · 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