Block #2,810,288

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/26/2018, 5:10:57 AM · Difficulty 11.6674 · 4,028,392 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c1b7f2b97f5bd91eee5795aa8a082e1eb881b51a526cb64cd7c64522e5083d0b

Height

#2,810,288

Difficulty

11.667374

Transactions

37

Size

10.20 KB

Version

2

Bits

0baad907

Nonce

975,499,995

Timestamp

8/26/2018, 5:10:57 AM

Confirmations

4,028,392

Merkle Root

7f0b5a0e1e829cc352d45c7dc4193386f0d8c352a8ceb8fca1096ce413faa93e
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.167 × 10⁹⁴(95-digit number)
21674190324934448719…14898485416121199081
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.167 × 10⁹⁴(95-digit number)
21674190324934448719…14898485416121199081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.334 × 10⁹⁴(95-digit number)
43348380649868897439…29796970832242398161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.669 × 10⁹⁴(95-digit number)
86696761299737794878…59593941664484796321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.733 × 10⁹⁵(96-digit number)
17339352259947558975…19187883328969592641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.467 × 10⁹⁵(96-digit number)
34678704519895117951…38375766657939185281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.935 × 10⁹⁵(96-digit number)
69357409039790235903…76751533315878370561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.387 × 10⁹⁶(97-digit number)
13871481807958047180…53503066631756741121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.774 × 10⁹⁶(97-digit number)
27742963615916094361…07006133263513482241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.548 × 10⁹⁶(97-digit number)
55485927231832188722…14012266527026964481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.109 × 10⁹⁷(98-digit number)
11097185446366437744…28024533054053928961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.219 × 10⁹⁷(98-digit number)
22194370892732875488…56049066108107857921
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,953,702 XPM·at block #6,838,679 · 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