Block #2,640,859

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 3:47:16 AM · Difficulty 11.5982 · 4,189,769 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8ec1d1ad5b49820b9148d042f4b0f80be2411bb2b388dd674df41da04ede58bc

Height

#2,640,859

Difficulty

11.598245

Transactions

12

Size

4.54 KB

Version

2

Bits

0b99268e

Nonce

482,418,456

Timestamp

5/1/2018, 3:47:16 AM

Confirmations

4,189,769

Merkle Root

2b795ea16f9a1f77f696a8947e9c65b9ede1177ec357eeb10602a0240fb3254e
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.

4.952 × 10⁹⁷(98-digit number)
49522230520937037094…66588800242325975041
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
4.952 × 10⁹⁷(98-digit number)
49522230520937037094…66588800242325975041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.904 × 10⁹⁷(98-digit number)
99044461041874074189…33177600484651950081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.980 × 10⁹⁸(99-digit number)
19808892208374814837…66355200969303900161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.961 × 10⁹⁸(99-digit number)
39617784416749629675…32710401938607800321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.923 × 10⁹⁸(99-digit number)
79235568833499259351…65420803877215600641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.584 × 10⁹⁹(100-digit number)
15847113766699851870…30841607754431201281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.169 × 10⁹⁹(100-digit number)
31694227533399703740…61683215508862402561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.338 × 10⁹⁹(100-digit number)
63388455066799407481…23366431017724805121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.267 × 10¹⁰⁰(101-digit number)
12677691013359881496…46732862035449610241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.535 × 10¹⁰⁰(101-digit number)
25355382026719762992…93465724070899220481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.071 × 10¹⁰⁰(101-digit number)
50710764053439525984…86931448141798440961
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,889,146 XPM·at block #6,830,627 · 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