Block #2,581,942

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2018, 12:56:40 AM · Difficulty 11.1036 · 4,251,149 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
192c4a9ff619d63fb3a7684fc0eb147d49f5dd175f020dcc272ac212eb3362fc

Height

#2,581,942

Difficulty

11.103632

Transactions

5

Size

1.67 KB

Version

2

Bits

0b1a879f

Nonce

340,753,345

Timestamp

3/24/2018, 12:56:40 AM

Confirmations

4,251,149

Merkle Root

8b1d33f04ecce17b574db6cd5207ddf33a3c062077512198e77a7a19395a9af1
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.

2.604 × 10⁹³(94-digit number)
26042646615705473392…49164115380031330261
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
2.604 × 10⁹³(94-digit number)
26042646615705473392…49164115380031330261
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.208 × 10⁹³(94-digit number)
52085293231410946785…98328230760062660521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.041 × 10⁹⁴(95-digit number)
10417058646282189357…96656461520125321041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.083 × 10⁹⁴(95-digit number)
20834117292564378714…93312923040250642081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.166 × 10⁹⁴(95-digit number)
41668234585128757428…86625846080501284161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.333 × 10⁹⁴(95-digit number)
83336469170257514857…73251692161002568321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.666 × 10⁹⁵(96-digit number)
16667293834051502971…46503384322005136641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.333 × 10⁹⁵(96-digit number)
33334587668103005942…93006768644010273281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.666 × 10⁹⁵(96-digit number)
66669175336206011885…86013537288020546561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.333 × 10⁹⁶(97-digit number)
13333835067241202377…72027074576041093121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.666 × 10⁹⁶(97-digit number)
26667670134482404754…44054149152082186241
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,908,904 XPM·at block #6,833,090 · 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