Block #2,654,897

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2018, 5:48:43 PM · Difficulty 11.7125 · 4,177,819 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a61941d38293e4af5e7de357f4375174dd93c22845fc55ad1edb2d4ac2d756c0

Height

#2,654,897

Difficulty

11.712473

Transactions

8

Size

3.04 KB

Version

2

Bits

0bb6649c

Nonce

1,194,137,044

Timestamp

5/9/2018, 5:48:43 PM

Confirmations

4,177,819

Merkle Root

52f0be7e650495aeeeb9850fcb44dc504ea035ab04ef7fe1e0d778e96b6577cb
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.493 × 10⁹⁵(96-digit number)
14931281719233664145…99064411382377963521
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.493 × 10⁹⁵(96-digit number)
14931281719233664145…99064411382377963521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.986 × 10⁹⁵(96-digit number)
29862563438467328290…98128822764755927041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.972 × 10⁹⁵(96-digit number)
59725126876934656581…96257645529511854081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.194 × 10⁹⁶(97-digit number)
11945025375386931316…92515291059023708161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.389 × 10⁹⁶(97-digit number)
23890050750773862632…85030582118047416321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.778 × 10⁹⁶(97-digit number)
47780101501547725265…70061164236094832641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.556 × 10⁹⁶(97-digit number)
95560203003095450530…40122328472189665281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.911 × 10⁹⁷(98-digit number)
19112040600619090106…80244656944379330561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.822 × 10⁹⁷(98-digit number)
38224081201238180212…60489313888758661121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.644 × 10⁹⁷(98-digit number)
76448162402476360424…20978627777517322241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.528 × 10⁹⁸(99-digit number)
15289632480495272084…41957255555034644481
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,905,888 XPM·at block #6,832,715 · 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