Block #2,876,578

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/11/2018, 10:07:54 AM · Difficulty 11.6534 · 3,967,467 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f128ade2f085bb606376988b96b8a52562794b0ce38213aa49d001ef5b51bede

Height

#2,876,578

Difficulty

11.653363

Transactions

6

Size

2.42 KB

Version

2

Bits

0ba742d0

Nonce

1,346,757,211

Timestamp

10/11/2018, 10:07:54 AM

Confirmations

3,967,467

Merkle Root

541713104b1f341b050199ddf61f7f0a3fc68c873b878fe3315230d703150c2e
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.

4.469 × 10⁹⁷(98-digit number)
44697027099444059159…85373744055105382401
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
4.469 × 10⁹⁷(98-digit number)
44697027099444059159…85373744055105382401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.939 × 10⁹⁷(98-digit number)
89394054198888118318…70747488110210764801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.787 × 10⁹⁸(99-digit number)
17878810839777623663…41494976220421529601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.575 × 10⁹⁸(99-digit number)
35757621679555247327…82989952440843059201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.151 × 10⁹⁸(99-digit number)
71515243359110494654…65979904881686118401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.430 × 10⁹⁹(100-digit number)
14303048671822098930…31959809763372236801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.860 × 10⁹⁹(100-digit number)
28606097343644197861…63919619526744473601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.721 × 10⁹⁹(100-digit number)
57212194687288395723…27839239053488947201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.144 × 10¹⁰⁰(101-digit number)
11442438937457679144…55678478106977894401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.288 × 10¹⁰⁰(101-digit number)
22884877874915358289…11356956213955788801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.576 × 10¹⁰⁰(101-digit number)
45769755749830716578…22713912427911577601
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,996,730 XPM·at block #6,844,044 · 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