Block #847,333

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2014, 6:41:04 AM · Difficulty 10.9720 · 5,993,758 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
893dd89c45781d9ee2c5428cf1b81a718030e19efb6a04b9c8fef0ed2ea2f20f

Height

#847,333

Difficulty

10.971954

Transactions

16

Size

4.08 KB

Version

2

Bits

0af8d1fc

Nonce

2,251,157,843

Timestamp

12/10/2014, 6:41:04 AM

Confirmations

5,993,758

Merkle Root

e598a7f7a915fcc1ae39d74f86d83f259a51b2211df638ad8dc067a5a6596d60
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.

8.581 × 10⁹⁶(97-digit number)
85819950840353973237…97481379988025402879
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
8.581 × 10⁹⁶(97-digit number)
85819950840353973237…97481379988025402879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.716 × 10⁹⁷(98-digit number)
17163990168070794647…94962759976050805759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.432 × 10⁹⁷(98-digit number)
34327980336141589295…89925519952101611519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.865 × 10⁹⁷(98-digit number)
68655960672283178590…79851039904203223039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.373 × 10⁹⁸(99-digit number)
13731192134456635718…59702079808406446079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.746 × 10⁹⁸(99-digit number)
27462384268913271436…19404159616812892159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.492 × 10⁹⁸(99-digit number)
54924768537826542872…38808319233625784319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.098 × 10⁹⁹(100-digit number)
10984953707565308574…77616638467251568639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.196 × 10⁹⁹(100-digit number)
21969907415130617148…55233276934503137279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.393 × 10⁹⁹(100-digit number)
43939814830261234297…10466553869006274559
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,973,092 XPM·at block #6,841,090 · 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