Block #418,836

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/25/2014, 4:50:03 AM · Difficulty 10.3829 · 6,388,375 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2fa52662a17d10048d7d95f5085361ae44ac85ccba90ac65972674d67be785f5

Height

#418,836

Difficulty

10.382897

Transactions

8

Size

2.45 KB

Version

2

Bits

0a620585

Nonce

56,366

Timestamp

2/25/2014, 4:50:03 AM

Confirmations

6,388,375

Merkle Root

7e12ce1cafa64cf10a690cd7fd37d189080188399a7faaa3d8db7d50b0aa3bce
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.906 × 10⁹⁷(98-digit number)
59061354997543189236…79310746247789424001
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.906 × 10⁹⁷(98-digit number)
59061354997543189236…79310746247789424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.181 × 10⁹⁸(99-digit number)
11812270999508637847…58621492495578848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.362 × 10⁹⁸(99-digit number)
23624541999017275694…17242984991157696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.724 × 10⁹⁸(99-digit number)
47249083998034551389…34485969982315392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.449 × 10⁹⁸(99-digit number)
94498167996069102778…68971939964630784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.889 × 10⁹⁹(100-digit number)
18899633599213820555…37943879929261568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.779 × 10⁹⁹(100-digit number)
37799267198427641111…75887759858523136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.559 × 10⁹⁹(100-digit number)
75598534396855282222…51775519717046272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.511 × 10¹⁰⁰(101-digit number)
15119706879371056444…03551039434092544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.023 × 10¹⁰⁰(101-digit number)
30239413758742112889…07102078868185088001
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,701,704 XPM·at block #6,807,210 · 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