Block #2,009,003

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/5/2017, 4:03:19 AM · Difficulty 10.7019 · 4,829,567 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6085236ec592389b8570c98e810a4d4d78d09f9c7c301b831c8f04609f4e46ee

Height

#2,009,003

Difficulty

10.701917

Transactions

2

Size

1.54 KB

Version

2

Bits

0ab3b0dd

Nonce

1,172,170,580

Timestamp

3/5/2017, 4:03:19 AM

Confirmations

4,829,567

Merkle Root

2f304fa21dd5dab2abd5123a2e642f0df77d47a10e28655e777602ba96d2900d
Transactions (2)
1 in → 1 out8.7400 XPM109 B
9 in → 1 out2195.4631 XPM1.34 KB
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.094 × 10⁹⁷(98-digit number)
50944188990869972217…82824175040382033921
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.094 × 10⁹⁷(98-digit number)
50944188990869972217…82824175040382033921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.018 × 10⁹⁸(99-digit number)
10188837798173994443…65648350080764067841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.037 × 10⁹⁸(99-digit number)
20377675596347988886…31296700161528135681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.075 × 10⁹⁸(99-digit number)
40755351192695977773…62593400323056271361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.151 × 10⁹⁸(99-digit number)
81510702385391955547…25186800646112542721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.630 × 10⁹⁹(100-digit number)
16302140477078391109…50373601292225085441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.260 × 10⁹⁹(100-digit number)
32604280954156782219…00747202584450170881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.520 × 10⁹⁹(100-digit number)
65208561908313564438…01494405168900341761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.304 × 10¹⁰⁰(101-digit number)
13041712381662712887…02988810337800683521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.608 × 10¹⁰⁰(101-digit number)
26083424763325425775…05977620675601367041
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,952,845 XPM·at block #6,838,569 · 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