Block #2,637,402

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2018, 10:07:37 PM · Difficulty 11.4392 · 4,195,162 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1b8a6ecf3f681ef81f5205626a2cad7006f912894a7d105c9429cdc4b8f1ed03

Height

#2,637,402

Difficulty

11.439153

Transactions

2

Size

428 B

Version

2

Bits

0b706c4e

Nonce

822,720,550

Timestamp

4/29/2018, 10:07:37 PM

Confirmations

4,195,162

Merkle Root

5931363159b789f7cf9c9a16404862a365421d73d59e53a76d3a475eafafae8f
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.

3.939 × 10⁹⁷(98-digit number)
39395034660192467220…91464717063341721601
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
3.939 × 10⁹⁷(98-digit number)
39395034660192467220…91464717063341721601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.879 × 10⁹⁷(98-digit number)
78790069320384934441…82929434126683443201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.575 × 10⁹⁸(99-digit number)
15758013864076986888…65858868253366886401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.151 × 10⁹⁸(99-digit number)
31516027728153973776…31717736506733772801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.303 × 10⁹⁸(99-digit number)
63032055456307947553…63435473013467545601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.260 × 10⁹⁹(100-digit number)
12606411091261589510…26870946026935091201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.521 × 10⁹⁹(100-digit number)
25212822182523179021…53741892053870182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.042 × 10⁹⁹(100-digit number)
50425644365046358042…07483784107740364801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.008 × 10¹⁰⁰(101-digit number)
10085128873009271608…14967568215480729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.017 × 10¹⁰⁰(101-digit number)
20170257746018543217…29935136430961459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.034 × 10¹⁰⁰(101-digit number)
40340515492037086434…59870272861922918401
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,904,670 XPM·at block #6,832,563 · 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