Block #2,154,715

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/10/2017, 12:22:16 PM · Difficulty 10.9045 · 4,690,632 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0a2b214d69705ee8bcf06c01488db9ec011d467a13ec4640f9bb31595540aa67

Height

#2,154,715

Difficulty

10.904501

Transactions

4

Size

1.80 KB

Version

2

Bits

0ae78d5a

Nonce

880,518,152

Timestamp

6/10/2017, 12:22:16 PM

Confirmations

4,690,632

Merkle Root

db75efc306ad4c4d325ab02ed5fc623d5b4c7836c07b467a6930d4d1e16a2eb1
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.

5.210 × 10⁹³(94-digit number)
52103907961047622644…24939244505401934401
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
5.210 × 10⁹³(94-digit number)
52103907961047622644…24939244505401934401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.042 × 10⁹⁴(95-digit number)
10420781592209524528…49878489010803868801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.084 × 10⁹⁴(95-digit number)
20841563184419049057…99756978021607737601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.168 × 10⁹⁴(95-digit number)
41683126368838098115…99513956043215475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.336 × 10⁹⁴(95-digit number)
83366252737676196231…99027912086430950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.667 × 10⁹⁵(96-digit number)
16673250547535239246…98055824172861900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.334 × 10⁹⁵(96-digit number)
33346501095070478492…96111648345723801601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.669 × 10⁹⁵(96-digit number)
66693002190140956985…92223296691447603201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.333 × 10⁹⁶(97-digit number)
13338600438028191397…84446593382895206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.667 × 10⁹⁶(97-digit number)
26677200876056382794…68893186765790412801
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:58,007,218 XPM·at block #6,845,346 · 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