Block #2,643,873

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 6:34:34 AM · Difficulty 11.6960 · 4,187,848 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fe1b6817fc5739b3a765476961ffebce09152a542ca37a049cbc0f70476fc0c8

Height

#2,643,873

Difficulty

11.695981

Transactions

48

Size

12.34 KB

Version

2

Bits

0bb22bd2

Nonce

276,486,739

Timestamp

5/2/2018, 6:34:34 AM

Confirmations

4,187,848

Merkle Root

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

9.997 × 10⁹³(94-digit number)
99978088711709241426…00107077817637791721
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
9.997 × 10⁹³(94-digit number)
99978088711709241426…00107077817637791721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.999 × 10⁹⁴(95-digit number)
19995617742341848285…00214155635275583441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.999 × 10⁹⁴(95-digit number)
39991235484683696570…00428311270551166881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.998 × 10⁹⁴(95-digit number)
79982470969367393141…00856622541102333761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.599 × 10⁹⁵(96-digit number)
15996494193873478628…01713245082204667521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.199 × 10⁹⁵(96-digit number)
31992988387746957256…03426490164409335041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.398 × 10⁹⁵(96-digit number)
63985976775493914512…06852980328818670081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.279 × 10⁹⁶(97-digit number)
12797195355098782902…13705960657637340161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.559 × 10⁹⁶(97-digit number)
25594390710197565805…27411921315274680321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.118 × 10⁹⁶(97-digit number)
51188781420395131610…54823842630549360641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.023 × 10⁹⁷(98-digit number)
10237756284079026322…09647685261098721281
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,897,872 XPM·at block #6,831,720 · 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