Block #406,331

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/16/2014, 5:02:35 AM · Difficulty 10.4280 · 6,419,190 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0bc15d91bfe935b53dfa610af16764167990e2a86f87ed398d70fdcab33bcd20

Height

#406,331

Difficulty

10.428045

Transactions

4

Size

14.75 KB

Version

2

Bits

0a6d9456

Nonce

365,623

Timestamp

2/16/2014, 5:02:35 AM

Confirmations

6,419,190

Merkle Root

48de6d80e2c3c8ab3715ac865c2872cec96a510602fb0ed38babd353dc40f1df
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.173 × 10¹⁰²(103-digit number)
11738850844109372567…94051475205588509579
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.173 × 10¹⁰²(103-digit number)
11738850844109372567…94051475205588509579
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.347 × 10¹⁰²(103-digit number)
23477701688218745135…88102950411177019159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.695 × 10¹⁰²(103-digit number)
46955403376437490270…76205900822354038319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.391 × 10¹⁰²(103-digit number)
93910806752874980540…52411801644708076639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.878 × 10¹⁰³(104-digit number)
18782161350574996108…04823603289416153279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.756 × 10¹⁰³(104-digit number)
37564322701149992216…09647206578832306559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.512 × 10¹⁰³(104-digit number)
75128645402299984432…19294413157664613119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.502 × 10¹⁰⁴(105-digit number)
15025729080459996886…38588826315329226239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.005 × 10¹⁰⁴(105-digit number)
30051458160919993772…77177652630658452479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.010 × 10¹⁰⁴(105-digit number)
60102916321839987545…54355305261316904959
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,848,263 XPM·at block #6,825,520 · 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