Block #2,197,054

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/7/2017, 10:11:53 AM · Difficulty 10.9540 · 4,648,337 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e780a707a138435cb422c7f0276c33a6381f4ffe0944fdcbbb4a97c2d3c16518

Height

#2,197,054

Difficulty

10.953976

Transactions

4

Size

2.71 KB

Version

2

Bits

0af437c9

Nonce

786,941,795

Timestamp

7/7/2017, 10:11:53 AM

Confirmations

4,648,337

Merkle Root

756c3051591f1bcd7b5df82f22e2132ba3d443474af6d461cd8070fe10e77b9c
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.

1.314 × 10⁹⁶(97-digit number)
13141524096145301131…85179877133265299201
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
1.314 × 10⁹⁶(97-digit number)
13141524096145301131…85179877133265299201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.628 × 10⁹⁶(97-digit number)
26283048192290602262…70359754266530598401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.256 × 10⁹⁶(97-digit number)
52566096384581204525…40719508533061196801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.051 × 10⁹⁷(98-digit number)
10513219276916240905…81439017066122393601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.102 × 10⁹⁷(98-digit number)
21026438553832481810…62878034132244787201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.205 × 10⁹⁷(98-digit number)
42052877107664963620…25756068264489574401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.410 × 10⁹⁷(98-digit number)
84105754215329927240…51512136528979148801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.682 × 10⁹⁸(99-digit number)
16821150843065985448…03024273057958297601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.364 × 10⁹⁸(99-digit number)
33642301686131970896…06048546115916595201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.728 × 10⁹⁸(99-digit number)
67284603372263941792…12097092231833190401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.345 × 10⁹⁹(100-digit number)
13456920674452788358…24194184463666380801
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:58,007,574 XPM·at block #6,845,390 · 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