Block #2,644,205

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 9:46:36 AM · Difficulty 11.7043 · 4,189,719 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9a35c166b15e77eb5796128b5070360be261eaed230a7b79628423612c5d8c08

Height

#2,644,205

Difficulty

11.704342

Transactions

54

Size

19.73 KB

Version

2

Bits

0bb44fc0

Nonce

145,017,939

Timestamp

5/2/2018, 9:46:36 AM

Confirmations

4,189,719

Merkle Root

ef092c39aa647905e8c7a29dacddde1e58c0a1bb98ca545552ab6e304674230a
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.770 × 10⁹⁶(97-digit number)
37701591350962990853…54426570205401600001
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.770 × 10⁹⁶(97-digit number)
37701591350962990853…54426570205401600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.540 × 10⁹⁶(97-digit number)
75403182701925981706…08853140410803200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.508 × 10⁹⁷(98-digit number)
15080636540385196341…17706280821606400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.016 × 10⁹⁷(98-digit number)
30161273080770392682…35412561643212800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.032 × 10⁹⁷(98-digit number)
60322546161540785365…70825123286425600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.206 × 10⁹⁸(99-digit number)
12064509232308157073…41650246572851200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.412 × 10⁹⁸(99-digit number)
24129018464616314146…83300493145702400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.825 × 10⁹⁸(99-digit number)
48258036929232628292…66600986291404800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.651 × 10⁹⁸(99-digit number)
96516073858465256584…33201972582809600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.930 × 10⁹⁹(100-digit number)
19303214771693051316…66403945165619200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.860 × 10⁹⁹(100-digit number)
38606429543386102633…32807890331238400001
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,915,619 XPM·at block #6,833,923 · 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