Block #2,801,963

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2018, 9:21:11 AM · Difficulty 11.6713 · 4,042,475 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
151668b1a8539236ca13201eca48a8e796cc00be67b3fa6141838a40eafc5ef5

Height

#2,801,963

Difficulty

11.671312

Transactions

2

Size

426 B

Version

2

Bits

0babdb20

Nonce

225,484,516

Timestamp

8/20/2018, 9:21:11 AM

Confirmations

4,042,475

Merkle Root

200d0621c40f984cf727b6fb615074dc3e0b07c7ef76892187c5b6f61b43e743
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.

3.674 × 10⁹⁵(96-digit number)
36747320560363437684…20815228609731640321
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
3.674 × 10⁹⁵(96-digit number)
36747320560363437684…20815228609731640321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.349 × 10⁹⁵(96-digit number)
73494641120726875368…41630457219463280641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.469 × 10⁹⁶(97-digit number)
14698928224145375073…83260914438926561281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.939 × 10⁹⁶(97-digit number)
29397856448290750147…66521828877853122561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.879 × 10⁹⁶(97-digit number)
58795712896581500295…33043657755706245121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.175 × 10⁹⁷(98-digit number)
11759142579316300059…66087315511412490241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.351 × 10⁹⁷(98-digit number)
23518285158632600118…32174631022824980481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.703 × 10⁹⁷(98-digit number)
47036570317265200236…64349262045649960961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.407 × 10⁹⁷(98-digit number)
94073140634530400472…28698524091299921921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.881 × 10⁹⁸(99-digit number)
18814628126906080094…57397048182599843841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.762 × 10⁹⁸(99-digit number)
37629256253812160188…14794096365199687681
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,999,900 XPM·at block #6,844,437 · 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