Block #2,810,162

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/26/2018, 2:56:59 AM · Difficulty 11.6679 · 4,029,334 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f7b338fb33a0f9bce25cf76a60fcc61db8c62548ebb71df41b6cf6c647937904

Height

#2,810,162

Difficulty

11.667859

Transactions

17

Size

3.96 KB

Version

2

Bits

0baaf8cb

Nonce

335,064,951

Timestamp

8/26/2018, 2:56:59 AM

Confirmations

4,029,334

Merkle Root

095743ad35fdbcdf82283200397d40de9c2507056bd9ee16fff7cf0b5ed3f50c
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.101 × 10⁹²(93-digit number)
21018857656071599497…43915489621153579921
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.101 × 10⁹²(93-digit number)
21018857656071599497…43915489621153579921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.203 × 10⁹²(93-digit number)
42037715312143198994…87830979242307159841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.407 × 10⁹²(93-digit number)
84075430624286397989…75661958484614319681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.681 × 10⁹³(94-digit number)
16815086124857279597…51323916969228639361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.363 × 10⁹³(94-digit number)
33630172249714559195…02647833938457278721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.726 × 10⁹³(94-digit number)
67260344499429118391…05295667876914557441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.345 × 10⁹⁴(95-digit number)
13452068899885823678…10591335753829114881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.690 × 10⁹⁴(95-digit number)
26904137799771647356…21182671507658229761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.380 × 10⁹⁴(95-digit number)
53808275599543294713…42365343015316459521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.076 × 10⁹⁵(96-digit number)
10761655119908658942…84730686030632919041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.152 × 10⁹⁵(96-digit number)
21523310239817317885…69461372061265838081
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,960,264 XPM·at block #6,839,495 · 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