Block #2,800,249

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/19/2018, 4:13:17 AM · Difficulty 11.6734 · 4,043,611 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
da294a372db8af6263bd8df892b558b0d5d899a8ac9eab8498911296810c26bf

Height

#2,800,249

Difficulty

11.673394

Transactions

10

Size

3.71 KB

Version

2

Bits

0bac638a

Nonce

287,388,282

Timestamp

8/19/2018, 4:13:17 AM

Confirmations

4,043,611

Merkle Root

3ef5b6c1f24ac191cb15bec6d6afecf42902f652f304c7e543ec720239183d17
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.010 × 10⁹³(94-digit number)
20103513313488983666…19215578343104016321
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.010 × 10⁹³(94-digit number)
20103513313488983666…19215578343104016321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.020 × 10⁹³(94-digit number)
40207026626977967333…38431156686208032641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.041 × 10⁹³(94-digit number)
80414053253955934667…76862313372416065281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.608 × 10⁹⁴(95-digit number)
16082810650791186933…53724626744832130561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.216 × 10⁹⁴(95-digit number)
32165621301582373867…07449253489664261121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.433 × 10⁹⁴(95-digit number)
64331242603164747734…14898506979328522241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.286 × 10⁹⁵(96-digit number)
12866248520632949546…29797013958657044481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.573 × 10⁹⁵(96-digit number)
25732497041265899093…59594027917314088961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.146 × 10⁹⁵(96-digit number)
51464994082531798187…19188055834628177921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.029 × 10⁹⁶(97-digit number)
10292998816506359637…38376111669256355841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.058 × 10⁹⁶(97-digit number)
20585997633012719274…76752223338512711681
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,995,248 XPM·at block #6,843,859 · 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