Block #2,136,913

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/29/2017, 2:13:06 PM · Difficulty 10.8911 · 4,706,139 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eabc05897b18c632d2ce121aa25eead5f331b58207bf21b0ba2e56520bac9ac5

Height

#2,136,913

Difficulty

10.891135

Transactions

5

Size

2.53 KB

Version

2

Bits

0ae4216a

Nonce

32,273,450

Timestamp

5/29/2017, 2:13:06 PM

Confirmations

4,706,139

Merkle Root

6453a9a2a029ca2c5d1c27cfd8e1a9bc6062fb1625b8fc6655fa51c8ed6ab25c
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.

2.681 × 10⁹⁷(98-digit number)
26814263236385856729…71069651920118000641
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
2.681 × 10⁹⁷(98-digit number)
26814263236385856729…71069651920118000641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.362 × 10⁹⁷(98-digit number)
53628526472771713458…42139303840236001281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.072 × 10⁹⁸(99-digit number)
10725705294554342691…84278607680472002561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.145 × 10⁹⁸(99-digit number)
21451410589108685383…68557215360944005121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.290 × 10⁹⁸(99-digit number)
42902821178217370766…37114430721888010241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.580 × 10⁹⁸(99-digit number)
85805642356434741533…74228861443776020481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.716 × 10⁹⁹(100-digit number)
17161128471286948306…48457722887552040961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.432 × 10⁹⁹(100-digit number)
34322256942573896613…96915445775104081921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.864 × 10⁹⁹(100-digit number)
68644513885147793226…93830891550208163841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.372 × 10¹⁰⁰(101-digit number)
13728902777029558645…87661783100416327681
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,988,774 XPM·at block #6,843,051 · 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