Block #2,643,989

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 7:38:35 AM · Difficulty 11.6992 · 4,194,499 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a935cc19789053c6557663013e7daca3f560c5dd64c825a066170c8d21397352

Height

#2,643,989

Difficulty

11.699173

Transactions

77

Size

25.51 KB

Version

2

Bits

0bb2fd00

Nonce

218,452,906

Timestamp

5/2/2018, 7:38:35 AM

Confirmations

4,194,499

Merkle Root

4ac03decf16097fc23ed905f6dcca6059723a6fc7fbf2210cbe990f7726a5b0a
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.828 × 10⁹⁴(95-digit number)
98288193696172634130…20007895322253228201
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.828 × 10⁹⁴(95-digit number)
98288193696172634130…20007895322253228201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.965 × 10⁹⁵(96-digit number)
19657638739234526826…40015790644506456401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.931 × 10⁹⁵(96-digit number)
39315277478469053652…80031581289012912801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.863 × 10⁹⁵(96-digit number)
78630554956938107304…60063162578025825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.572 × 10⁹⁶(97-digit number)
15726110991387621460…20126325156051651201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.145 × 10⁹⁶(97-digit number)
31452221982775242921…40252650312103302401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.290 × 10⁹⁶(97-digit number)
62904443965550485843…80505300624206604801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.258 × 10⁹⁷(98-digit number)
12580888793110097168…61010601248413209601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.516 × 10⁹⁷(98-digit number)
25161777586220194337…22021202496826419201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.032 × 10⁹⁷(98-digit number)
50323555172440388674…44042404993652838401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.006 × 10⁹⁸(99-digit number)
10064711034488077734…88084809987305676801
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,952,176 XPM·at block #6,838,487 · 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