Block #408,040

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/17/2014, 9:23:52 AM · Difficulty 10.4304 · 6,400,951 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
65eea19a8bbca266900001c1f3df54bfdc2af9a32cac34cf139330807d876c1c

Height

#408,040

Difficulty

10.430417

Transactions

4

Size

1.17 KB

Version

2

Bits

0a6e2fc9

Nonce

46,057

Timestamp

2/17/2014, 9:23:52 AM

Confirmations

6,400,951

Merkle Root

b405a1fe36b0fe43a70d3d18cdfb01732ebc913e27600d6d387a0fd90bbbd25c
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.869 × 10⁹⁶(97-digit number)
28695385012413364729…45754174116161663441
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.869 × 10⁹⁶(97-digit number)
28695385012413364729…45754174116161663441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.739 × 10⁹⁶(97-digit number)
57390770024826729458…91508348232323326881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.147 × 10⁹⁷(98-digit number)
11478154004965345891…83016696464646653761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.295 × 10⁹⁷(98-digit number)
22956308009930691783…66033392929293307521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.591 × 10⁹⁷(98-digit number)
45912616019861383566…32066785858586615041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.182 × 10⁹⁷(98-digit number)
91825232039722767133…64133571717173230081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.836 × 10⁹⁸(99-digit number)
18365046407944553426…28267143434346460161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.673 × 10⁹⁸(99-digit number)
36730092815889106853…56534286868692920321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.346 × 10⁹⁸(99-digit number)
73460185631778213706…13068573737385840641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.469 × 10⁹⁹(100-digit number)
14692037126355642741…26137147474771681281
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,715,986 XPM·at block #6,808,990 · 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