Block #412,324

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/20/2014, 10:49:38 AM · Difficulty 10.4187 · 6,397,361 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee956414041b1fe301483302bc1c47ab33c051f1262f00de3aecb2e40a797642

Height

#412,324

Difficulty

10.418689

Transactions

2

Size

1.04 KB

Version

2

Bits

0a6b2f34

Nonce

118,668

Timestamp

2/20/2014, 10:49:38 AM

Confirmations

6,397,361

Merkle Root

150123f5e3580388e9712356754df1b2852963d76c9fe712d6e70d78385a9fd9
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.458 × 10⁹⁹(100-digit number)
14586839915170017928…79309218800664780799
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.458 × 10⁹⁹(100-digit number)
14586839915170017928…79309218800664780799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.917 × 10⁹⁹(100-digit number)
29173679830340035856…58618437601329561599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.834 × 10⁹⁹(100-digit number)
58347359660680071713…17236875202659123199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.166 × 10¹⁰⁰(101-digit number)
11669471932136014342…34473750405318246399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.333 × 10¹⁰⁰(101-digit number)
23338943864272028685…68947500810636492799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.667 × 10¹⁰⁰(101-digit number)
46677887728544057370…37895001621272985599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.335 × 10¹⁰⁰(101-digit number)
93355775457088114741…75790003242545971199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.867 × 10¹⁰¹(102-digit number)
18671155091417622948…51580006485091942399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.734 × 10¹⁰¹(102-digit number)
37342310182835245896…03160012970183884799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.468 × 10¹⁰¹(102-digit number)
74684620365670491793…06320025940367769599
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,721,555 XPM·at block #6,809,684 · 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