Block #2,802,558

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2018, 7:30:12 PM · Difficulty 11.6704 · 4,031,174 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
12fc4f24ac2d24765b2cb1f2182fa01c3ea176fb2658a75aeb83e1dfbc592f4c

Height

#2,802,558

Difficulty

11.670368

Transactions

7

Size

1.83 KB

Version

2

Bits

0bab9d36

Nonce

1,162,934,579

Timestamp

8/20/2018, 7:30:12 PM

Confirmations

4,031,174

Merkle Root

06c05e95d1b95da8e01efd8bd39540564b005209700231b87293fbf23e2775df
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.835 × 10⁹¹(92-digit number)
78355431288395391387…91758215898723216701
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.835 × 10⁹¹(92-digit number)
78355431288395391387…91758215898723216701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.567 × 10⁹²(93-digit number)
15671086257679078277…83516431797446433401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.134 × 10⁹²(93-digit number)
31342172515358156554…67032863594892866801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.268 × 10⁹²(93-digit number)
62684345030716313109…34065727189785733601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.253 × 10⁹³(94-digit number)
12536869006143262621…68131454379571467201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.507 × 10⁹³(94-digit number)
25073738012286525243…36262908759142934401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.014 × 10⁹³(94-digit number)
50147476024573050487…72525817518285868801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.002 × 10⁹⁴(95-digit number)
10029495204914610097…45051635036571737601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.005 × 10⁹⁴(95-digit number)
20058990409829220195…90103270073143475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.011 × 10⁹⁴(95-digit number)
40117980819658440390…80206540146286950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.023 × 10⁹⁴(95-digit number)
80235961639316880780…60413080292573900801
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,914,079 XPM·at block #6,833,731 · 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