Block #2,656,470

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/11/2018, 2:29:10 AM · Difficulty 11.6893 · 4,175,285 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5158a59b01149069d62bc19d9d5ad2a1a3e553cf4b6c5c2bfd9704ba0439e6f6

Height

#2,656,470

Difficulty

11.689314

Transactions

2

Size

1018 B

Version

2

Bits

0bb076e1

Nonce

852,836,292

Timestamp

5/11/2018, 2:29:10 AM

Confirmations

4,175,285

Merkle Root

4946b6e6550391a3445bf004b69c2c496de0485b62e3852c25147630816512a5
Transactions (2)
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.930 × 10⁹⁴(95-digit number)
29302202625749582710…42452498283308071521
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.930 × 10⁹⁴(95-digit number)
29302202625749582710…42452498283308071521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.860 × 10⁹⁴(95-digit number)
58604405251499165420…84904996566616143041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.172 × 10⁹⁵(96-digit number)
11720881050299833084…69809993133232286081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.344 × 10⁹⁵(96-digit number)
23441762100599666168…39619986266464572161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.688 × 10⁹⁵(96-digit number)
46883524201199332336…79239972532929144321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.376 × 10⁹⁵(96-digit number)
93767048402398664672…58479945065858288641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.875 × 10⁹⁶(97-digit number)
18753409680479732934…16959890131716577281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.750 × 10⁹⁶(97-digit number)
37506819360959465868…33919780263433154561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.501 × 10⁹⁶(97-digit number)
75013638721918931737…67839560526866309121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.500 × 10⁹⁷(98-digit number)
15002727744383786347…35679121053732618241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.000 × 10⁹⁷(98-digit number)
30005455488767572695…71358242107465236481
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,898,148 XPM·at block #6,831,754 · 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