Block #2,642,423

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 5:37:33 PM · Difficulty 11.6525 · 4,170,223 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5385131d3b4f0c135ef5641e09fc1c5562b7ad16feb4860341552f8d007c2e14

Height

#2,642,423

Difficulty

11.652474

Transactions

4

Size

1.07 KB

Version

2

Bits

0ba70885

Nonce

2,040,551,020

Timestamp

5/1/2018, 5:37:33 PM

Confirmations

4,170,223

Merkle Root

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

7.056 × 10⁹⁵(96-digit number)
70569205053356267791…43348521345770442241
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
7.056 × 10⁹⁵(96-digit number)
70569205053356267791…43348521345770442241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.411 × 10⁹⁶(97-digit number)
14113841010671253558…86697042691540884481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.822 × 10⁹⁶(97-digit number)
28227682021342507116…73394085383081768961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.645 × 10⁹⁶(97-digit number)
56455364042685014233…46788170766163537921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.129 × 10⁹⁷(98-digit number)
11291072808537002846…93576341532327075841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.258 × 10⁹⁷(98-digit number)
22582145617074005693…87152683064654151681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.516 × 10⁹⁷(98-digit number)
45164291234148011386…74305366129308303361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.032 × 10⁹⁷(98-digit number)
90328582468296022772…48610732258616606721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.806 × 10⁹⁸(99-digit number)
18065716493659204554…97221464517233213441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.613 × 10⁹⁸(99-digit number)
36131432987318409109…94442929034466426881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.226 × 10⁹⁸(99-digit number)
72262865974636818218…88885858068932853761
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,745,196 XPM·at block #6,812,645 · 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