Block #2,640,982

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 4:57:51 AM · Difficulty 11.6022 · 4,197,509 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f721ff2de40678144e9ed32277ae75c92c7076eaa65a73e3785138f3c702c5ef

Height

#2,640,982

Difficulty

11.602248

Transactions

12

Size

4.28 KB

Version

2

Bits

0b9a2cf4

Nonce

138,055,398

Timestamp

5/1/2018, 4:57:51 AM

Confirmations

4,197,509

Merkle Root

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

6.106 × 10⁹²(93-digit number)
61067848696702155206…85439382359513841281
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
6.106 × 10⁹²(93-digit number)
61067848696702155206…85439382359513841281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.221 × 10⁹³(94-digit number)
12213569739340431041…70878764719027682561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.442 × 10⁹³(94-digit number)
24427139478680862082…41757529438055365121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.885 × 10⁹³(94-digit number)
48854278957361724165…83515058876110730241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.770 × 10⁹³(94-digit number)
97708557914723448330…67030117752221460481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.954 × 10⁹⁴(95-digit number)
19541711582944689666…34060235504442920961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.908 × 10⁹⁴(95-digit number)
39083423165889379332…68120471008885841921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.816 × 10⁹⁴(95-digit number)
78166846331778758664…36240942017771683841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.563 × 10⁹⁵(96-digit number)
15633369266355751732…72481884035543367681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.126 × 10⁹⁵(96-digit number)
31266738532711503465…44963768071086735361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.253 × 10⁹⁵(96-digit number)
62533477065423006931…89927536142173470721
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,200 XPM·at block #6,838,490 · 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