Block #2,223,988

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/26/2017, 4:55:03 PM · Difficulty 10.9466 · 4,613,794 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
69585739b50f43c0223c52dd863fcef783d7569680fc83995797a3d55208f850

Height

#2,223,988

Difficulty

10.946580

Transactions

6

Size

2.28 KB

Version

2

Bits

0af25313

Nonce

202,673,637

Timestamp

7/26/2017, 4:55:03 PM

Confirmations

4,613,794

Merkle Root

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

6.610 × 10⁹⁴(95-digit number)
66106519347696111135…53640675462856771201
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
6.610 × 10⁹⁴(95-digit number)
66106519347696111135…53640675462856771201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.322 × 10⁹⁵(96-digit number)
13221303869539222227…07281350925713542401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.644 × 10⁹⁵(96-digit number)
26442607739078444454…14562701851427084801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.288 × 10⁹⁵(96-digit number)
52885215478156888908…29125403702854169601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.057 × 10⁹⁶(97-digit number)
10577043095631377781…58250807405708339201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.115 × 10⁹⁶(97-digit number)
21154086191262755563…16501614811416678401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.230 × 10⁹⁶(97-digit number)
42308172382525511126…33003229622833356801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.461 × 10⁹⁶(97-digit number)
84616344765051022253…66006459245666713601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.692 × 10⁹⁷(98-digit number)
16923268953010204450…32012918491333427201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.384 × 10⁹⁷(98-digit number)
33846537906020408901…64025836982666854401
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,946,593 XPM·at block #6,837,781 · 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