Block #405,903

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/15/2014, 9:12:01 PM · Difficulty 10.4339 · 6,421,059 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
19a3dfe9f64ef99c74c598fd754f9b0112ec20df009b184790e43d2fe418dbf4

Height

#405,903

Difficulty

10.433911

Transactions

4

Size

1.85 KB

Version

2

Bits

0a6f14ce

Nonce

99,191

Timestamp

2/15/2014, 9:12:01 PM

Confirmations

6,421,059

Merkle Root

0eaca549b555e841fe7ef447e3316ceb057081e41479c98ecdc5a9bbb5b2a767
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.179 × 10¹⁰¹(102-digit number)
21793677136830743809…12262185027375013759
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.179 × 10¹⁰¹(102-digit number)
21793677136830743809…12262185027375013759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.358 × 10¹⁰¹(102-digit number)
43587354273661487619…24524370054750027519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.717 × 10¹⁰¹(102-digit number)
87174708547322975238…49048740109500055039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.743 × 10¹⁰²(103-digit number)
17434941709464595047…98097480219000110079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.486 × 10¹⁰²(103-digit number)
34869883418929190095…96194960438000220159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.973 × 10¹⁰²(103-digit number)
69739766837858380190…92389920876000440319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.394 × 10¹⁰³(104-digit number)
13947953367571676038…84779841752000880639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.789 × 10¹⁰³(104-digit number)
27895906735143352076…69559683504001761279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.579 × 10¹⁰³(104-digit number)
55791813470286704152…39119367008003522559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.115 × 10¹⁰⁴(105-digit number)
11158362694057340830…78238734016007045119
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,859,872 XPM·at block #6,826,961 · 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