Block #2,637,200

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2018, 8:37:04 PM · Difficulty 11.4265 · 4,206,149 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
79cb951a0d7be02b32916395bc86cbe0fc369a6a21f8f37c56dabe6a17600dbe

Height

#2,637,200

Difficulty

11.426546

Transactions

2

Size

1.08 KB

Version

2

Bits

0b6d3221

Nonce

431,677,671

Timestamp

4/29/2018, 8:37:04 PM

Confirmations

4,206,149

Merkle Root

3846d80bec9ac2b79bf75dbea975810231b0df3e8ec2863ccb3a1916bbd162aa
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.

4.877 × 10⁹⁵(96-digit number)
48772476326695107540…69645434992635320801
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
4.877 × 10⁹⁵(96-digit number)
48772476326695107540…69645434992635320801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.754 × 10⁹⁵(96-digit number)
97544952653390215081…39290869985270641601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.950 × 10⁹⁶(97-digit number)
19508990530678043016…78581739970541283201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.901 × 10⁹⁶(97-digit number)
39017981061356086032…57163479941082566401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.803 × 10⁹⁶(97-digit number)
78035962122712172065…14326959882165132801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.560 × 10⁹⁷(98-digit number)
15607192424542434413…28653919764330265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.121 × 10⁹⁷(98-digit number)
31214384849084868826…57307839528660531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.242 × 10⁹⁷(98-digit number)
62428769698169737652…14615679057321062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.248 × 10⁹⁸(99-digit number)
12485753939633947530…29231358114642124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.497 × 10⁹⁸(99-digit number)
24971507879267895060…58462716229284249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.994 × 10⁹⁸(99-digit number)
49943015758535790121…16925432458568499201
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,991,153 XPM·at block #6,843,348 · 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