Block #2,642,156

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 3:08:53 PM · Difficulty 11.6442 · 4,189,361 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
28e83661d2b4b5d9efcbf1590d63e730724d12804380f6fa51560e7616aaf254

Height

#2,642,156

Difficulty

11.644218

Transactions

20

Size

5.91 KB

Version

2

Bits

0ba4eb78

Nonce

951,711,286

Timestamp

5/1/2018, 3:08:53 PM

Confirmations

4,189,361

Merkle Root

5f665a7ac162157a5a6ca6969719f719e67b8b4a058821aaa75e172a0c8c4390
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.032 × 10⁹⁶(97-digit number)
10328447772328945652…60415636831003268481
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.032 × 10⁹⁶(97-digit number)
10328447772328945652…60415636831003268481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.065 × 10⁹⁶(97-digit number)
20656895544657891305…20831273662006536961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.131 × 10⁹⁶(97-digit number)
41313791089315782610…41662547324013073921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.262 × 10⁹⁶(97-digit number)
82627582178631565220…83325094648026147841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.652 × 10⁹⁷(98-digit number)
16525516435726313044…66650189296052295681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.305 × 10⁹⁷(98-digit number)
33051032871452626088…33300378592104591361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.610 × 10⁹⁷(98-digit number)
66102065742905252176…66600757184209182721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.322 × 10⁹⁸(99-digit number)
13220413148581050435…33201514368418365441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.644 × 10⁹⁸(99-digit number)
26440826297162100870…66403028736836730881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.288 × 10⁹⁸(99-digit number)
52881652594324201741…32806057473673461761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.057 × 10⁹⁹(100-digit number)
10576330518864840348…65612114947346923521
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,896,225 XPM·at block #6,831,516 · 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