Block #2,150,280

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/7/2017, 2:58:15 PM · Difficulty 10.8991 · 4,667,665 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
123f007ece3613f2512b685b65531b33766a5f7770b8f673ca1a643064f611e8

Height

#2,150,280

Difficulty

10.899090

Transactions

4

Size

3.14 KB

Version

2

Bits

0ae62abd

Nonce

218,139,034

Timestamp

6/7/2017, 2:58:15 PM

Confirmations

4,667,665

Merkle Root

2b68ccacce15e66e914bb798356581002dc057c7ba5c439db785539fe767e793
Transactions (4)
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.713 × 10⁹⁷(98-digit number)
17136109045477372333…83566885983613911041
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.713 × 10⁹⁷(98-digit number)
17136109045477372333…83566885983613911041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.427 × 10⁹⁷(98-digit number)
34272218090954744667…67133771967227822081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.854 × 10⁹⁷(98-digit number)
68544436181909489335…34267543934455644161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.370 × 10⁹⁸(99-digit number)
13708887236381897867…68535087868911288321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.741 × 10⁹⁸(99-digit number)
27417774472763795734…37070175737822576641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.483 × 10⁹⁸(99-digit number)
54835548945527591468…74140351475645153281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.096 × 10⁹⁹(100-digit number)
10967109789105518293…48280702951290306561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.193 × 10⁹⁹(100-digit number)
21934219578211036587…96561405902580613121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.386 × 10⁹⁹(100-digit number)
43868439156422073174…93122811805161226241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.773 × 10⁹⁹(100-digit number)
87736878312844146349…86245623610322452481
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,787,627 XPM·at block #6,817,944 · 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