Block #2,648,592

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/4/2018, 3:12:09 PM · Difficulty 11.7663 · 4,185,145 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a24da41c2e9217d0448bb77cc381220ad4e784bf13c7e31996020b41486af791

Height

#2,648,592

Difficulty

11.766285

Transactions

41

Size

12.35 KB

Version

2

Bits

0bc42b3b

Nonce

988,031,202

Timestamp

5/4/2018, 3:12:09 PM

Confirmations

4,185,145

Merkle Root

ebc2ef9ef5a4a21519253ad14df889f4e4a2a800262fcb243bd17063a9d7e7b6
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.145 × 10⁹⁶(97-digit number)
11458227956649703545…60420120793670625281
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.145 × 10⁹⁶(97-digit number)
11458227956649703545…60420120793670625281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.291 × 10⁹⁶(97-digit number)
22916455913299407091…20840241587341250561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.583 × 10⁹⁶(97-digit number)
45832911826598814183…41680483174682501121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.166 × 10⁹⁶(97-digit number)
91665823653197628367…83360966349365002241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.833 × 10⁹⁷(98-digit number)
18333164730639525673…66721932698730004481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.666 × 10⁹⁷(98-digit number)
36666329461279051347…33443865397460008961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.333 × 10⁹⁷(98-digit number)
73332658922558102694…66887730794920017921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.466 × 10⁹⁸(99-digit number)
14666531784511620538…33775461589840035841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.933 × 10⁹⁸(99-digit number)
29333063569023241077…67550923179680071681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.866 × 10⁹⁸(99-digit number)
58666127138046482155…35101846359360143361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.173 × 10⁹⁹(100-digit number)
11733225427609296431…70203692718720286721
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,914,113 XPM·at block #6,833,736 · 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