Block #2,478,818

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2018, 1:02:12 PM · Difficulty 10.9656 · 4,366,328 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8934e222b672190151944a0a7c755c898d56027d0853217d653290141191343b

Height

#2,478,818

Difficulty

10.965639

Transactions

46

Size

13.54 KB

Version

2

Bits

0af73424

Nonce

1,863,627,339

Timestamp

1/18/2018, 1:02:12 PM

Confirmations

4,366,328

Merkle Root

48c3ede1b1420872f3eec731e64337e37c04ee5e6c47540688f7ee57ae5037a2
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.

7.404 × 10⁹³(94-digit number)
74041923697293994288…87416739442739501301
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
7.404 × 10⁹³(94-digit number)
74041923697293994288…87416739442739501301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.480 × 10⁹⁴(95-digit number)
14808384739458798857…74833478885479002601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.961 × 10⁹⁴(95-digit number)
29616769478917597715…49666957770958005201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.923 × 10⁹⁴(95-digit number)
59233538957835195430…99333915541916010401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.184 × 10⁹⁵(96-digit number)
11846707791567039086…98667831083832020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.369 × 10⁹⁵(96-digit number)
23693415583134078172…97335662167664041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.738 × 10⁹⁵(96-digit number)
47386831166268156344…94671324335328083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.477 × 10⁹⁵(96-digit number)
94773662332536312689…89342648670656166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.895 × 10⁹⁶(97-digit number)
18954732466507262537…78685297341312332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.790 × 10⁹⁶(97-digit number)
37909464933014525075…57370594682624665601
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:58,005,594 XPM·at block #6,845,145 · 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