Block #2,642,559

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 6:56:47 PM · Difficulty 11.6564 · 4,188,210 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e7ebd47f07e6cbdfd7f7a3e833681b9e6a3aaeee7059c0a83c7a7c1bc8f9d026

Height

#2,642,559

Difficulty

11.656403

Transactions

12

Size

3.55 KB

Version

2

Bits

0ba80a0a

Nonce

238,684,569

Timestamp

5/1/2018, 6:56:47 PM

Confirmations

4,188,210

Merkle Root

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

1.495 × 10⁹⁷(98-digit number)
14951246662867380842…46795526379185858561
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
1.495 × 10⁹⁷(98-digit number)
14951246662867380842…46795526379185858561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.990 × 10⁹⁷(98-digit number)
29902493325734761684…93591052758371717121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.980 × 10⁹⁷(98-digit number)
59804986651469523368…87182105516743434241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.196 × 10⁹⁸(99-digit number)
11960997330293904673…74364211033486868481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.392 × 10⁹⁸(99-digit number)
23921994660587809347…48728422066973736961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.784 × 10⁹⁸(99-digit number)
47843989321175618694…97456844133947473921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.568 × 10⁹⁸(99-digit number)
95687978642351237388…94913688267894947841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.913 × 10⁹⁹(100-digit number)
19137595728470247477…89827376535789895681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.827 × 10⁹⁹(100-digit number)
38275191456940494955…79654753071579791361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.655 × 10⁹⁹(100-digit number)
76550382913880989911…59309506143159582721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.531 × 10¹⁰⁰(101-digit number)
15310076582776197982…18619012286319165441
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,890,288 XPM·at block #6,830,768 · 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