Block #2,642,021

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 1:57:38 PM · Difficulty 11.6398 · 4,189,703 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b3d7edce5e9da4f43b5aba848f1fe756daff5c0469a96e781546996c54d57714

Height

#2,642,021

Difficulty

11.639752

Transactions

9

Size

2.78 KB

Version

2

Bits

0ba3c6c9

Nonce

805,616,583

Timestamp

5/1/2018, 1:57:38 PM

Confirmations

4,189,703

Merkle Root

e75766df708af6b30f02e9d759884a7b2004019856452af06d762ecb9c9af7f3
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.118 × 10⁹⁶(97-digit number)
31182279592677070769…87640400501507477121
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.118 × 10⁹⁶(97-digit number)
31182279592677070769…87640400501507477121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.236 × 10⁹⁶(97-digit number)
62364559185354141539…75280801003014954241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.247 × 10⁹⁷(98-digit number)
12472911837070828307…50561602006029908481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.494 × 10⁹⁷(98-digit number)
24945823674141656615…01123204012059816961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.989 × 10⁹⁷(98-digit number)
49891647348283313231…02246408024119633921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.978 × 10⁹⁷(98-digit number)
99783294696566626463…04492816048239267841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.995 × 10⁹⁸(99-digit number)
19956658939313325292…08985632096478535681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.991 × 10⁹⁸(99-digit number)
39913317878626650585…17971264192957071361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.982 × 10⁹⁸(99-digit number)
79826635757253301170…35942528385914142721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.596 × 10⁹⁹(100-digit number)
15965327151450660234…71885056771828285441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.193 × 10⁹⁹(100-digit number)
31930654302901320468…43770113543656570881
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,897,897 XPM·at block #6,831,723 · 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