Block #2,142,981

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/3/2017, 4:46:10 AM · Difficulty 10.8784 · 4,702,045 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f076d0a479cc1074306265666f1b2f3bf69dddd0006c89a24c1f74335c3f1f8e

Height

#2,142,981

Difficulty

10.878431

Transactions

2

Size

574 B

Version

2

Bits

0ae0e0d5

Nonce

1,128,494,222

Timestamp

6/3/2017, 4:46:10 AM

Confirmations

4,702,045

Merkle Root

548bc1592df57310d25ed04ac40c2eec550831f67d64456dbee2a856ab5e6163
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.

2.151 × 10⁹³(94-digit number)
21510447872046393614…84228274204465506551
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.151 × 10⁹³(94-digit number)
21510447872046393614…84228274204465506551
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.302 × 10⁹³(94-digit number)
43020895744092787229…68456548408931013101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.604 × 10⁹³(94-digit number)
86041791488185574459…36913096817862026201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.720 × 10⁹⁴(95-digit number)
17208358297637114891…73826193635724052401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.441 × 10⁹⁴(95-digit number)
34416716595274229783…47652387271448104801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.883 × 10⁹⁴(95-digit number)
68833433190548459567…95304774542896209601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.376 × 10⁹⁵(96-digit number)
13766686638109691913…90609549085792419201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.753 × 10⁹⁵(96-digit number)
27533373276219383827…81219098171584838401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.506 × 10⁹⁵(96-digit number)
55066746552438767654…62438196343169676801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.101 × 10⁹⁶(97-digit number)
11013349310487753530…24876392686339353601
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,004,633 XPM·at block #6,845,025 · 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