Block #418,064

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/24/2014, 2:02:07 PM · Difficulty 10.3967 · 6,408,827 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ee4ee8232d339aeec1c6da81b2d99b72f2a9e6cb798272772a0239e4d3e23bf3

Height

#418,064

Difficulty

10.396658

Transactions

3

Size

2.67 KB

Version

2

Bits

0a658b67

Nonce

231,903

Timestamp

2/24/2014, 2:02:07 PM

Confirmations

6,408,827

Merkle Root

c9e5adb65ee530ca2fda23de24c3d97a6fc67e84abc6c1a89be96fc263033b0f
Transactions (3)
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.449 × 10¹⁰⁴(105-digit number)
34494508395260332288…19588029832366693761
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.449 × 10¹⁰⁴(105-digit number)
34494508395260332288…19588029832366693761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.898 × 10¹⁰⁴(105-digit number)
68989016790520664577…39176059664733387521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.379 × 10¹⁰⁵(106-digit number)
13797803358104132915…78352119329466775041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.759 × 10¹⁰⁵(106-digit number)
27595606716208265831…56704238658933550081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.519 × 10¹⁰⁵(106-digit number)
55191213432416531662…13408477317867100161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.103 × 10¹⁰⁶(107-digit number)
11038242686483306332…26816954635734200321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.207 × 10¹⁰⁶(107-digit number)
22076485372966612664…53633909271468400641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.415 × 10¹⁰⁶(107-digit number)
44152970745933225329…07267818542936801281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.830 × 10¹⁰⁶(107-digit number)
88305941491866450659…14535637085873602561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.766 × 10¹⁰⁷(108-digit number)
17661188298373290131…29071274171747205121
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,859,294 XPM·at block #6,826,890 · 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