Block #409,862

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/18/2014, 4:18:00 PM · Difficulty 10.4291 · 6,407,412 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
34217d8ce68c4c0734ea5a95ed60037f3234c618238a28d2c26eea0c78f229e1

Height

#409,862

Difficulty

10.429051

Transactions

3

Size

1.06 KB

Version

2

Bits

0a6dd649

Nonce

29,406

Timestamp

2/18/2014, 4:18:00 PM

Confirmations

6,407,412

Merkle Root

762e3a5eb45289bd3c6964c5338a3d5487ed2150b7f4f05e5667968f4abcd927
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.

2.155 × 10⁹⁸(99-digit number)
21554517567795259027…59145045497555463041
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
2.155 × 10⁹⁸(99-digit number)
21554517567795259027…59145045497555463041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.310 × 10⁹⁸(99-digit number)
43109035135590518054…18290090995110926081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.621 × 10⁹⁸(99-digit number)
86218070271181036108…36580181990221852161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.724 × 10⁹⁹(100-digit number)
17243614054236207221…73160363980443704321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.448 × 10⁹⁹(100-digit number)
34487228108472414443…46320727960887408641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.897 × 10⁹⁹(100-digit number)
68974456216944828886…92641455921774817281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.379 × 10¹⁰⁰(101-digit number)
13794891243388965777…85282911843549634561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.758 × 10¹⁰⁰(101-digit number)
27589782486777931554…70565823687099269121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.517 × 10¹⁰⁰(101-digit number)
55179564973555863109…41131647374198538241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.103 × 10¹⁰¹(102-digit number)
11035912994711172621…82263294748397076481
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,782,230 XPM·at block #6,817,273 · 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