Block #470,911

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/2/2014, 6:10:44 AM · Difficulty 10.4297 · 6,338,458 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8876a795903acd5780e3a72991c3132968ed257ab8133db00dea82ab73c060dd

Height

#470,911

Difficulty

10.429690

Transactions

4

Size

3.72 KB

Version

2

Bits

0a6e002f

Nonce

258,252

Timestamp

4/2/2014, 6:10:44 AM

Confirmations

6,338,458

Merkle Root

55b68b9b30bd0485a657b561e1907920e23bc215ce72081f5c3e95d2c6a3e17f
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.398 × 10⁹⁹(100-digit number)
43985629652879239576…27010086570519696641
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.398 × 10⁹⁹(100-digit number)
43985629652879239576…27010086570519696641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.797 × 10⁹⁹(100-digit number)
87971259305758479152…54020173141039393281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.759 × 10¹⁰⁰(101-digit number)
17594251861151695830…08040346282078786561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.518 × 10¹⁰⁰(101-digit number)
35188503722303391660…16080692564157573121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.037 × 10¹⁰⁰(101-digit number)
70377007444606783321…32161385128315146241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.407 × 10¹⁰¹(102-digit number)
14075401488921356664…64322770256630292481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.815 × 10¹⁰¹(102-digit number)
28150802977842713328…28645540513260584961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.630 × 10¹⁰¹(102-digit number)
56301605955685426657…57291081026521169921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.126 × 10¹⁰²(103-digit number)
11260321191137085331…14582162053042339841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.252 × 10¹⁰²(103-digit number)
22520642382274170662…29164324106084679681
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,719,021 XPM·at block #6,809,368 · 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