Block #4,059,684

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/31/2021, 3:14:58 PM · Difficulty 10.8052 · 2,767,210 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f74926919bb1c917ebac0bb80e5a0189b9a4c09e94fce08bf4be9dcc0bb42135

Height

#4,059,684

Difficulty

10.805226

Transactions

5

Size

1.93 KB

Version

2

Bits

0ace234d

Nonce

2,083,217,051

Timestamp

1/31/2021, 3:14:58 PM

Confirmations

2,767,210

Merkle Root

b0a73797f739e47d01cd7869248b487bcad7685dbfeb49ec02bc2ef8dbec42ec
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.572 × 10⁹⁵(96-digit number)
15725529192546948610…76285745075560727281
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.572 × 10⁹⁵(96-digit number)
15725529192546948610…76285745075560727281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.145 × 10⁹⁵(96-digit number)
31451058385093897221…52571490151121454561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.290 × 10⁹⁵(96-digit number)
62902116770187794443…05142980302242909121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.258 × 10⁹⁶(97-digit number)
12580423354037558888…10285960604485818241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.516 × 10⁹⁶(97-digit number)
25160846708075117777…20571921208971636481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.032 × 10⁹⁶(97-digit number)
50321693416150235555…41143842417943272961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.006 × 10⁹⁷(98-digit number)
10064338683230047111…82287684835886545921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.012 × 10⁹⁷(98-digit number)
20128677366460094222…64575369671773091841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.025 × 10⁹⁷(98-digit number)
40257354732920188444…29150739343546183681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.051 × 10⁹⁷(98-digit number)
80514709465840376888…58301478687092367361
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,859,318 XPM·at block #6,826,893 · 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