Block #428,052

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/3/2014, 7:36:42 PM · Difficulty 10.3479 · 6,397,137 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
99a84ff358dfb622e33cda35656b61c4f369f625d696c82db0548cf8c9bae731

Height

#428,052

Difficulty

10.347870

Transactions

6

Size

2.15 KB

Version

2

Bits

0a590dfc

Nonce

11,687

Timestamp

3/3/2014, 7:36:42 PM

Confirmations

6,397,137

Merkle Root

26ce74845a78c2f030777199d265a26e56e94c12d4383975fcb828592bd0de70
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.

3.981 × 10¹⁰⁰(101-digit number)
39816096956126571362…16347969471759360001
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
3.981 × 10¹⁰⁰(101-digit number)
39816096956126571362…16347969471759360001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.963 × 10¹⁰⁰(101-digit number)
79632193912253142725…32695938943518720001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.592 × 10¹⁰¹(102-digit number)
15926438782450628545…65391877887037440001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.185 × 10¹⁰¹(102-digit number)
31852877564901257090…30783755774074880001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.370 × 10¹⁰¹(102-digit number)
63705755129802514180…61567511548149760001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.274 × 10¹⁰²(103-digit number)
12741151025960502836…23135023096299520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.548 × 10¹⁰²(103-digit number)
25482302051921005672…46270046192599040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.096 × 10¹⁰²(103-digit number)
50964604103842011344…92540092385198080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.019 × 10¹⁰³(104-digit number)
10192920820768402268…85080184770396160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.038 × 10¹⁰³(104-digit number)
20385841641536804537…70160369540792320001
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,845,603 XPM·at block #6,825,188 · 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