Block #856,310

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2014, 11:46:57 PM · Difficulty 10.9682 · 5,954,839 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ebeefb55e75b48573cfc03989914d9fd37891855e22433fa67e6c56763b654f2

Height

#856,310

Difficulty

10.968155

Transactions

12

Size

2.56 KB

Version

2

Bits

0af7d909

Nonce

1,200,888,708

Timestamp

12/16/2014, 11:46:57 PM

Confirmations

5,954,839

Merkle Root

716aabb1f87499f795e65b02a0a6004a8890edc3ec859797e1a37d5c57db4acc
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.

1.199 × 10⁹⁵(96-digit number)
11994147347417740786…99681669329821942399
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
1.199 × 10⁹⁵(96-digit number)
11994147347417740786…99681669329821942399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.398 × 10⁹⁵(96-digit number)
23988294694835481573…99363338659643884799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.797 × 10⁹⁵(96-digit number)
47976589389670963146…98726677319287769599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.595 × 10⁹⁵(96-digit number)
95953178779341926292…97453354638575539199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.919 × 10⁹⁶(97-digit number)
19190635755868385258…94906709277151078399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.838 × 10⁹⁶(97-digit number)
38381271511736770516…89813418554302156799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.676 × 10⁹⁶(97-digit number)
76762543023473541033…79626837108604313599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.535 × 10⁹⁷(98-digit number)
15352508604694708206…59253674217208627199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.070 × 10⁹⁷(98-digit number)
30705017209389416413…18507348434417254399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.141 × 10⁹⁷(98-digit number)
61410034418778832827…37014696868834508799
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,733,302 XPM·at block #6,811,148 · 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.

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