Block #2,243,119

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/8/2017, 10:59:18 PM · Difficulty 10.9477 · 4,602,261 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
388df584b6103ce6323e7c924c5e55d9e622007a85b973af62d3e745735160b7

Height

#2,243,119

Difficulty

10.947654

Transactions

2

Size

1.14 KB

Version

2

Bits

0af29979

Nonce

461,978,858

Timestamp

8/8/2017, 10:59:18 PM

Confirmations

4,602,261

Merkle Root

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

1.686 × 10⁹⁴(95-digit number)
16862959012673605574…49183032754633812231
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.686 × 10⁹⁴(95-digit number)
16862959012673605574…49183032754633812231
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.372 × 10⁹⁴(95-digit number)
33725918025347211148…98366065509267624461
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.745 × 10⁹⁴(95-digit number)
67451836050694422297…96732131018535248921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.349 × 10⁹⁵(96-digit number)
13490367210138884459…93464262037070497841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.698 × 10⁹⁵(96-digit number)
26980734420277768919…86928524074140995681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.396 × 10⁹⁵(96-digit number)
53961468840555537838…73857048148281991361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.079 × 10⁹⁶(97-digit number)
10792293768111107567…47714096296563982721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.158 × 10⁹⁶(97-digit number)
21584587536222215135…95428192593127965441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.316 × 10⁹⁶(97-digit number)
43169175072444430270…90856385186255930881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.633 × 10⁹⁶(97-digit number)
86338350144888860541…81712770372511861761
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,485 XPM·at block #6,845,379 · 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