Block #2,463,221

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2018, 9:03:38 AM · Difficulty 10.9579 · 4,364,009 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3b24d6cbf6b25d629b866d07fd66271682d2abfff4b3e58b651ee61daf1a2ea6

Height

#2,463,221

Difficulty

10.957920

Transactions

2

Size

6.34 KB

Version

2

Bits

0af53a3a

Nonce

588,395,726

Timestamp

1/8/2018, 9:03:38 AM

Confirmations

4,364,009

Merkle Root

a265d3f2b15c9549bb702e004954f6ec7d05c6cdfbfe2d84e3285a002be10226
Transactions (2)
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.866 × 10⁹⁵(96-digit number)
58665858333102222664…24959173291772953601
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.866 × 10⁹⁵(96-digit number)
58665858333102222664…24959173291772953601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.173 × 10⁹⁶(97-digit number)
11733171666620444532…49918346583545907201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.346 × 10⁹⁶(97-digit number)
23466343333240889065…99836693167091814401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.693 × 10⁹⁶(97-digit number)
46932686666481778131…99673386334183628801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.386 × 10⁹⁶(97-digit number)
93865373332963556263…99346772668367257601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.877 × 10⁹⁷(98-digit number)
18773074666592711252…98693545336734515201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.754 × 10⁹⁷(98-digit number)
37546149333185422505…97387090673469030401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.509 × 10⁹⁷(98-digit number)
75092298666370845010…94774181346938060801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.501 × 10⁹⁸(99-digit number)
15018459733274169002…89548362693876121601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.003 × 10⁹⁸(99-digit number)
30036919466548338004…79096725387752243201
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,861,940 XPM·at block #6,827,229 · 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