Block #2,656,274

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/10/2018, 10:42:49 PM · Difficulty 11.6913 · 4,181,967 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9ce4163578468ad22061a427e38385ba9044b6c822669a6005d937700d56dacd

Height

#2,656,274

Difficulty

11.691270

Transactions

3

Size

1.61 KB

Version

2

Bits

0bb0f718

Nonce

706,027,924

Timestamp

5/10/2018, 10:42:49 PM

Confirmations

4,181,967

Merkle Root

8e504a1d5fd47040c29d665fb880960429f00f89dfcb80d55082f0cc16f50634
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.

2.183 × 10⁹⁶(97-digit number)
21834975797286082249…64895851045238103041
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
2.183 × 10⁹⁶(97-digit number)
21834975797286082249…64895851045238103041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.366 × 10⁹⁶(97-digit number)
43669951594572164499…29791702090476206081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.733 × 10⁹⁶(97-digit number)
87339903189144328999…59583404180952412161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.746 × 10⁹⁷(98-digit number)
17467980637828865799…19166808361904824321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.493 × 10⁹⁷(98-digit number)
34935961275657731599…38333616723809648641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.987 × 10⁹⁷(98-digit number)
69871922551315463199…76667233447619297281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.397 × 10⁹⁸(99-digit number)
13974384510263092639…53334466895238594561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.794 × 10⁹⁸(99-digit number)
27948769020526185279…06668933790477189121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.589 × 10⁹⁸(99-digit number)
55897538041052370559…13337867580954378241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.117 × 10⁹⁹(100-digit number)
11179507608210474111…26675735161908756481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.235 × 10⁹⁹(100-digit number)
22359015216420948223…53351470323817512961
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,950,204 XPM·at block #6,838,240 · 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