Block #2,653,568

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/8/2018, 12:22:58 PM · Difficulty 11.7361 · 4,179,987 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c783c86ae17e1fc250fcdbad5dc1188c4db98536ca0e71a91a8d941ec95aab39

Height

#2,653,568

Difficulty

11.736094

Transactions

3

Size

2.23 KB

Version

2

Bits

0bbc70af

Nonce

33,876,599

Timestamp

5/8/2018, 12:22:58 PM

Confirmations

4,179,987

Merkle Root

53ff79291b6216e271c80530c8849c8089a252f97a683a19231ea88a2c42d5a8
Transactions (3)
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.

5.388 × 10⁹⁶(97-digit number)
53888786402713142809…99641314790485446401
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
5.388 × 10⁹⁶(97-digit number)
53888786402713142809…99641314790485446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.077 × 10⁹⁷(98-digit number)
10777757280542628561…99282629580970892801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.155 × 10⁹⁷(98-digit number)
21555514561085257123…98565259161941785601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.311 × 10⁹⁷(98-digit number)
43111029122170514247…97130518323883571201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.622 × 10⁹⁷(98-digit number)
86222058244341028495…94261036647767142401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.724 × 10⁹⁸(99-digit number)
17244411648868205699…88522073295534284801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.448 × 10⁹⁸(99-digit number)
34488823297736411398…77044146591068569601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.897 × 10⁹⁸(99-digit number)
68977646595472822796…54088293182137139201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.379 × 10⁹⁹(100-digit number)
13795529319094564559…08176586364274278401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.759 × 10⁹⁹(100-digit number)
27591058638189129118…16353172728548556801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.518 × 10⁹⁹(100-digit number)
55182117276378258236…32706345457097113601
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,912,640 XPM·at block #6,833,554 · 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