Block #406,198

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/16/2014, 2:25:18 AM · Difficulty 10.4316 · 6,408,641 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cc4fa856c6e5156c2551f02c7c5c7599d7f52ad37d0f62491415b9e59e8c243b

Height

#406,198

Difficulty

10.431645

Transactions

2

Size

1.25 KB

Version

2

Bits

0a6e8046

Nonce

80

Timestamp

2/16/2014, 2:25:18 AM

Confirmations

6,408,641

Merkle Root

ffff87707024017d9e0150c387d5cf0c6957cadee0754c80cd34e2b7ad913bd4
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.418 × 10⁹⁹(100-digit number)
14185439499828481844…23267400645958796799
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.418 × 10⁹⁹(100-digit number)
14185439499828481844…23267400645958796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.837 × 10⁹⁹(100-digit number)
28370878999656963688…46534801291917593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.674 × 10⁹⁹(100-digit number)
56741757999313927376…93069602583835187199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.134 × 10¹⁰⁰(101-digit number)
11348351599862785475…86139205167670374399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.269 × 10¹⁰⁰(101-digit number)
22696703199725570950…72278410335340748799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.539 × 10¹⁰⁰(101-digit number)
45393406399451141901…44556820670681497599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.078 × 10¹⁰⁰(101-digit number)
90786812798902283802…89113641341362995199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.815 × 10¹⁰¹(102-digit number)
18157362559780456760…78227282682725990399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.631 × 10¹⁰¹(102-digit number)
36314725119560913521…56454565365451980799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.262 × 10¹⁰¹(102-digit number)
72629450239121827042…12909130730903961599
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,762,795 XPM·at block #6,814,838 · 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