Block #405,503

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/15/2014, 3:01:13 PM · Difficulty 10.4302 · 6,405,471 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
13f356ce14117951e01bd1aa0ccb9b273de66d3f69efb192d2332dcde34fabab

Height

#405,503

Difficulty

10.430222

Transactions

4

Size

1.54 KB

Version

2

Bits

0a6e2306

Nonce

188,080

Timestamp

2/15/2014, 3:01:13 PM

Confirmations

6,405,471

Merkle Root

f8e9859d0c74c3211c0010585823c981d367d316ba2539353d0a0e0a6eff8464
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.

5.137 × 10⁹³(94-digit number)
51372929428775174435…31445977629953760321
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
5.137 × 10⁹³(94-digit number)
51372929428775174435…31445977629953760321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.027 × 10⁹⁴(95-digit number)
10274585885755034887…62891955259907520641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.054 × 10⁹⁴(95-digit number)
20549171771510069774…25783910519815041281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.109 × 10⁹⁴(95-digit number)
41098343543020139548…51567821039630082561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.219 × 10⁹⁴(95-digit number)
82196687086040279096…03135642079260165121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.643 × 10⁹⁵(96-digit number)
16439337417208055819…06271284158520330241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.287 × 10⁹⁵(96-digit number)
32878674834416111638…12542568317040660481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.575 × 10⁹⁵(96-digit number)
65757349668832223277…25085136634081320961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.315 × 10⁹⁶(97-digit number)
13151469933766444655…50170273268162641921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.630 × 10⁹⁶(97-digit number)
26302939867532889310…00340546536325283841
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,731,894 XPM·at block #6,810,973 · 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