Block #2,165,384

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/18/2017, 3:40:13 AM · Difficulty 10.8984 · 4,652,592 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
19950800b97c0760a268a00fba3a16cffe7bffeb82108df618727410118665f0

Height

#2,165,384

Difficulty

10.898385

Transactions

8

Size

3.91 KB

Version

2

Bits

0ae5fc89

Nonce

559,296,798

Timestamp

6/18/2017, 3:40:13 AM

Confirmations

4,652,592

Merkle Root

5447abf82e3a266eba26afe52d0e3d4a0cc44bad84cdb0a7a2f1154819c973da
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.450 × 10⁹³(94-digit number)
14500239695668407274…67279521330927089761
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.450 × 10⁹³(94-digit number)
14500239695668407274…67279521330927089761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.900 × 10⁹³(94-digit number)
29000479391336814549…34559042661854179521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.800 × 10⁹³(94-digit number)
58000958782673629098…69118085323708359041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.160 × 10⁹⁴(95-digit number)
11600191756534725819…38236170647416718081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.320 × 10⁹⁴(95-digit number)
23200383513069451639…76472341294833436161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.640 × 10⁹⁴(95-digit number)
46400767026138903278…52944682589666872321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.280 × 10⁹⁴(95-digit number)
92801534052277806557…05889365179333744641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.856 × 10⁹⁵(96-digit number)
18560306810455561311…11778730358667489281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.712 × 10⁹⁵(96-digit number)
37120613620911122622…23557460717334978561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.424 × 10⁹⁵(96-digit number)
74241227241822245245…47114921434669957121
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,787,878 XPM·at block #6,817,975 · 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