Block #2,802,870

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/21/2018, 1:03:25 AM · Difficulty 11.6690 · 4,034,652 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7eb770f9e7c409928ccd4723e1dc3d79bdf4e7565f51d10b9906800942a6c5f7

Height

#2,802,870

Difficulty

11.669021

Transactions

31

Size

8.17 KB

Version

2

Bits

0bab44f7

Nonce

1,267,859,496

Timestamp

8/21/2018, 1:03:25 AM

Confirmations

4,034,652

Merkle Root

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

6.113 × 10⁹⁴(95-digit number)
61136537870216641286…17448621208785642881
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
6.113 × 10⁹⁴(95-digit number)
61136537870216641286…17448621208785642881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.222 × 10⁹⁵(96-digit number)
12227307574043328257…34897242417571285761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.445 × 10⁹⁵(96-digit number)
24454615148086656514…69794484835142571521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.890 × 10⁹⁵(96-digit number)
48909230296173313029…39588969670285143041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.781 × 10⁹⁵(96-digit number)
97818460592346626058…79177939340570286081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.956 × 10⁹⁶(97-digit number)
19563692118469325211…58355878681140572161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.912 × 10⁹⁶(97-digit number)
39127384236938650423…16711757362281144321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.825 × 10⁹⁶(97-digit number)
78254768473877300846…33423514724562288641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.565 × 10⁹⁷(98-digit number)
15650953694775460169…66847029449124577281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.130 × 10⁹⁷(98-digit number)
31301907389550920338…33694058898249154561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.260 × 10⁹⁷(98-digit number)
62603814779101840677…67388117796498309121
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,944,502 XPM·at block #6,837,521 · 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