Block #198,951

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/8/2013, 1:45:16 AM · Difficulty 9.8867 · 6,613,262 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7902f3ec75f75f1fd9562a9c017e9606b1c494e7fbdbf3d43230fbd9896bc33a

Height

#198,951

Difficulty

9.886672

Transactions

2

Size

391 B

Version

2

Bits

09e2fceb

Nonce

9,580

Timestamp

10/8/2013, 1:45:16 AM

Confirmations

6,613,262

Merkle Root

bc89fd2526480b8154812183ea1886d0876e13499e33c894c5ce7e08c33fc33f
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.

1.933 × 10⁹⁴(95-digit number)
19330759226048461499…81101925645014384641
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.933 × 10⁹⁴(95-digit number)
19330759226048461499…81101925645014384641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.866 × 10⁹⁴(95-digit number)
38661518452096922998…62203851290028769281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.732 × 10⁹⁴(95-digit number)
77323036904193845997…24407702580057538561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.546 × 10⁹⁵(96-digit number)
15464607380838769199…48815405160115077121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.092 × 10⁹⁵(96-digit number)
30929214761677538399…97630810320230154241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.185 × 10⁹⁵(96-digit number)
61858429523355076798…95261620640460308481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.237 × 10⁹⁶(97-digit number)
12371685904671015359…90523241280920616961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.474 × 10⁹⁶(97-digit number)
24743371809342030719…81046482561841233921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.948 × 10⁹⁶(97-digit number)
49486743618684061438…62092965123682467841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.897 × 10⁹⁶(97-digit number)
98973487237368122877…24185930247364935681
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,741,717 XPM·at block #6,812,212 · 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.

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