Block #418,178

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/24/2014, 4:09:23 PM · Difficulty 10.3959 · 6,397,857 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a69c822320adcaa0b6f29da9d2d17078f69fff5ea6ae4cf9fd854b35b42096a1

Height

#418,178

Difficulty

10.395882

Transactions

13

Size

3.88 KB

Version

2

Bits

0a65587f

Nonce

385,619

Timestamp

2/24/2014, 4:09:23 PM

Confirmations

6,397,857

Merkle Root

abe9b9dbf2d66f87908f5f7e278cea56103d252291165f886514475c1ce1cc8b
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.067 × 10⁹⁸(99-digit number)
50673015068098152042…01542450648146091521
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.067 × 10⁹⁸(99-digit number)
50673015068098152042…01542450648146091521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.013 × 10⁹⁹(100-digit number)
10134603013619630408…03084901296292183041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.026 × 10⁹⁹(100-digit number)
20269206027239260817…06169802592584366081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.053 × 10⁹⁹(100-digit number)
40538412054478521634…12339605185168732161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.107 × 10⁹⁹(100-digit number)
81076824108957043268…24679210370337464321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.621 × 10¹⁰⁰(101-digit number)
16215364821791408653…49358420740674928641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.243 × 10¹⁰⁰(101-digit number)
32430729643582817307…98716841481349857281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.486 × 10¹⁰⁰(101-digit number)
64861459287165634614…97433682962699714561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.297 × 10¹⁰¹(102-digit number)
12972291857433126922…94867365925399429121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.594 × 10¹⁰¹(102-digit number)
25944583714866253845…89734731850798858241
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,772,394 XPM·at block #6,816,034 · 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