Block #405,035

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/15/2014, 7:29:49 AM · Difficulty 10.4278 · 6,411,219 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
32c0a4724b47fa4c65020ce9eb584648bd5b0daaa52d21f28a9c9c7b4d0671dc

Height

#405,035

Difficulty

10.427804

Transactions

8

Size

2.04 KB

Version

2

Bits

0a6d8496

Nonce

14,272

Timestamp

2/15/2014, 7:29:49 AM

Confirmations

6,411,219

Merkle Root

94d891a54661825cd77c5726f75957e390b023666067cf0a4ca9ffd3a065d9c7
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.

9.928 × 10⁹⁷(98-digit number)
99285680540041663053…57158854443117961001
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
9.928 × 10⁹⁷(98-digit number)
99285680540041663053…57158854443117961001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.985 × 10⁹⁸(99-digit number)
19857136108008332610…14317708886235922001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.971 × 10⁹⁸(99-digit number)
39714272216016665221…28635417772471844001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.942 × 10⁹⁸(99-digit number)
79428544432033330443…57270835544943688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.588 × 10⁹⁹(100-digit number)
15885708886406666088…14541671089887376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.177 × 10⁹⁹(100-digit number)
31771417772813332177…29083342179774752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.354 × 10⁹⁹(100-digit number)
63542835545626664354…58166684359549504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.270 × 10¹⁰⁰(101-digit number)
12708567109125332870…16333368719099008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.541 × 10¹⁰⁰(101-digit number)
25417134218250665741…32666737438198016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.083 × 10¹⁰⁰(101-digit number)
50834268436501331483…65333474876396032001
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,774,152 XPM·at block #6,816,253 · 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