Block #422,480

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/27/2014, 6:33:58 PM · Difficulty 10.3771 · 6,386,388 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
446eecb16d4951225b3c12dd8216a4627f59edf7902b95bf02e40965ec4d56be

Height

#422,480

Difficulty

10.377082

Transactions

1

Size

1.01 KB

Version

2

Bits

0a608870

Nonce

1,488

Timestamp

2/27/2014, 6:33:58 PM

Confirmations

6,386,388

Merkle Root

719ff4c9543476f930350fae12b862eea296779bf358fe318f030cf2482aff42
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.

4.568 × 10⁹⁸(99-digit number)
45685395289321110514…11139244568255123841
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
4.568 × 10⁹⁸(99-digit number)
45685395289321110514…11139244568255123841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.137 × 10⁹⁸(99-digit number)
91370790578642221028…22278489136510247681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.827 × 10⁹⁹(100-digit number)
18274158115728444205…44556978273020495361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.654 × 10⁹⁹(100-digit number)
36548316231456888411…89113956546040990721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.309 × 10⁹⁹(100-digit number)
73096632462913776822…78227913092081981441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.461 × 10¹⁰⁰(101-digit number)
14619326492582755364…56455826184163962881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.923 × 10¹⁰⁰(101-digit number)
29238652985165510729…12911652368327925761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.847 × 10¹⁰⁰(101-digit number)
58477305970331021458…25823304736655851521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.169 × 10¹⁰¹(102-digit number)
11695461194066204291…51646609473311703041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.339 × 10¹⁰¹(102-digit number)
23390922388132408583…03293218946623406081
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,714,994 XPM·at block #6,808,867 · 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.

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