Block #2,488,333

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/24/2018, 5:28:41 PM · Difficulty 10.9698 · 4,354,089 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6db0946e02a565444c9bf43953a39ee8daaf2fe87822209c049523f914e79666

Height

#2,488,333

Difficulty

10.969828

Transactions

60

Size

22.85 KB

Version

2

Bits

0af846a1

Nonce

160,173,360

Timestamp

1/24/2018, 5:28:41 PM

Confirmations

4,354,089

Merkle Root

00218ab5381ab360546c358541de652e0ff4adb11871c7db1e477c4191666827
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.

1.494 × 10⁹³(94-digit number)
14947225297170741642…69815383048507694241
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
1.494 × 10⁹³(94-digit number)
14947225297170741642…69815383048507694241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.989 × 10⁹³(94-digit number)
29894450594341483285…39630766097015388481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.978 × 10⁹³(94-digit number)
59788901188682966570…79261532194030776961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.195 × 10⁹⁴(95-digit number)
11957780237736593314…58523064388061553921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.391 × 10⁹⁴(95-digit number)
23915560475473186628…17046128776123107841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.783 × 10⁹⁴(95-digit number)
47831120950946373256…34092257552246215681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.566 × 10⁹⁴(95-digit number)
95662241901892746513…68184515104492431361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.913 × 10⁹⁵(96-digit number)
19132448380378549302…36369030208984862721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.826 × 10⁹⁵(96-digit number)
38264896760757098605…72738060417969725441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.652 × 10⁹⁵(96-digit number)
76529793521514197210…45476120835939450881
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,983,791 XPM·at block #6,842,421 · 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