Block #405,377

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/15/2014, 12:49:28 PM · Difficulty 10.4306 · 6,421,613 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d95e5aad6cf15f0856163a8da8dde071ede86d9a6be465c98c3c50b1fd806af3

Height

#405,377

Difficulty

10.430645

Transactions

2

Size

429 B

Version

2

Bits

0a6e3ec2

Nonce

192,722

Timestamp

2/15/2014, 12:49:28 PM

Confirmations

6,421,613

Merkle Root

88a3e90dc2d394a2f7129be32d22f609e17c8e6e0eba2ad132d9eb8bbb2a5243
Transactions (2)
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.527 × 10¹⁰⁵(106-digit number)
25272585393325376822…72359044064554178561
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.527 × 10¹⁰⁵(106-digit number)
25272585393325376822…72359044064554178561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.054 × 10¹⁰⁵(106-digit number)
50545170786650753645…44718088129108357121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.010 × 10¹⁰⁶(107-digit number)
10109034157330150729…89436176258216714241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.021 × 10¹⁰⁶(107-digit number)
20218068314660301458…78872352516433428481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.043 × 10¹⁰⁶(107-digit number)
40436136629320602916…57744705032866856961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.087 × 10¹⁰⁶(107-digit number)
80872273258641205833…15489410065733713921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.617 × 10¹⁰⁷(108-digit number)
16174454651728241166…30978820131467427841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.234 × 10¹⁰⁷(108-digit number)
32348909303456482333…61957640262934855681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.469 × 10¹⁰⁷(108-digit number)
64697818606912964666…23915280525869711361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.293 × 10¹⁰⁸(109-digit number)
12939563721382592933…47830561051739422721
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,860,094 XPM·at block #6,826,989 · 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