Block #2,209,018

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/16/2017, 10:15:16 AM · Difficulty 10.9443 · 4,618,091 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
28dbdf6f05b9479e2a692e97995eebba23a852645cfa3782348efb46667695ba

Height

#2,209,018

Difficulty

10.944287

Transactions

2

Size

425 B

Version

2

Bits

0af1bccd

Nonce

1,099,293,308

Timestamp

7/16/2017, 10:15:16 AM

Confirmations

4,618,091

Merkle Root

284c045e939653cff2e056d24b736348f7f5472e379dbe713503ae3e5e782023
Transactions (2)
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.

9.267 × 10⁹³(94-digit number)
92673205912022163493…78553210138057037001
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
9.267 × 10⁹³(94-digit number)
92673205912022163493…78553210138057037001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.853 × 10⁹⁴(95-digit number)
18534641182404432698…57106420276114074001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.706 × 10⁹⁴(95-digit number)
37069282364808865397…14212840552228148001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.413 × 10⁹⁴(95-digit number)
74138564729617730794…28425681104456296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.482 × 10⁹⁵(96-digit number)
14827712945923546158…56851362208912592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.965 × 10⁹⁵(96-digit number)
29655425891847092317…13702724417825184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.931 × 10⁹⁵(96-digit number)
59310851783694184635…27405448835650368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.186 × 10⁹⁶(97-digit number)
11862170356738836927…54810897671300736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.372 × 10⁹⁶(97-digit number)
23724340713477673854…09621795342601472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.744 × 10⁹⁶(97-digit number)
47448681426955347708…19243590685202944001
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,861,051 XPM·at block #6,827,108 · 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