Block #408,326

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/17/2014, 2:05:05 PM · Difficulty 10.4309 · 6,416,344 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d9917fd0b12db96f84a8cf8f908234473722a0e8b8805037b33a81ff0ce08351

Height

#408,326

Difficulty

10.430874

Transactions

2

Size

1.49 KB

Version

2

Bits

0a6e4dc9

Nonce

8,883

Timestamp

2/17/2014, 2:05:05 PM

Confirmations

6,416,344

Merkle Root

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

2.622 × 10⁹³(94-digit number)
26221035368013746660…20157520285881324999
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
2.622 × 10⁹³(94-digit number)
26221035368013746660…20157520285881324999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.244 × 10⁹³(94-digit number)
52442070736027493321…40315040571762649999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.048 × 10⁹⁴(95-digit number)
10488414147205498664…80630081143525299999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.097 × 10⁹⁴(95-digit number)
20976828294410997328…61260162287050599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.195 × 10⁹⁴(95-digit number)
41953656588821994656…22520324574101199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.390 × 10⁹⁴(95-digit number)
83907313177643989313…45040649148202399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.678 × 10⁹⁵(96-digit number)
16781462635528797862…90081298296404799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.356 × 10⁹⁵(96-digit number)
33562925271057595725…80162596592809599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.712 × 10⁹⁵(96-digit number)
67125850542115191450…60325193185619199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.342 × 10⁹⁶(97-digit number)
13425170108423038290…20650386371238399999
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,841,423 XPM·at block #6,824,669 · 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