Block #855,573

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2014, 11:04:12 AM · Difficulty 10.9683 · 5,989,341 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
635136132991449573725cc8373481fc29a384bab89b4b6da34105a9f7cb9c7a

Height

#855,573

Difficulty

10.968293

Transactions

4

Size

886 B

Version

2

Bits

0af7e20d

Nonce

233,491,136

Timestamp

12/16/2014, 11:04:12 AM

Confirmations

5,989,341

Merkle Root

3983fa1a83cf285fb828f7c8c1e57f06baca14cbc72c61c93cad9fc1f43cf48f
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.

9.926 × 10⁹⁵(96-digit number)
99262700490652500152…91150008895463948999
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
9.926 × 10⁹⁵(96-digit number)
99262700490652500152…91150008895463948999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.985 × 10⁹⁶(97-digit number)
19852540098130500030…82300017790927897999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.970 × 10⁹⁶(97-digit number)
39705080196261000060…64600035581855795999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.941 × 10⁹⁶(97-digit number)
79410160392522000121…29200071163711591999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.588 × 10⁹⁷(98-digit number)
15882032078504400024…58400142327423183999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.176 × 10⁹⁷(98-digit number)
31764064157008800048…16800284654846367999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.352 × 10⁹⁷(98-digit number)
63528128314017600097…33600569309692735999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.270 × 10⁹⁸(99-digit number)
12705625662803520019…67201138619385471999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.541 × 10⁹⁸(99-digit number)
25411251325607040039…34402277238770943999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.082 × 10⁹⁸(99-digit number)
50822502651214080078…68804554477541887999
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:58,003,728 XPM·at block #6,844,913 · 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