Block #2,223,136

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/26/2017, 3:51:26 AM · Difficulty 10.9458 · 4,615,057 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
733dd04fe34b63e942b21bc3d4a6d1b983e7e320b704cf37416d9a90b78bbe89

Height

#2,223,136

Difficulty

10.945846

Transactions

2

Size

425 B

Version

2

Bits

0af222f9

Nonce

2,037,574,787

Timestamp

7/26/2017, 3:51:26 AM

Confirmations

4,615,057

Merkle Root

8eca1287c9542b028e7c19cfe837e8cf63a63ed60031c7c6ab52125d4d88e827
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.

3.983 × 10⁹³(94-digit number)
39838995751808304305…56125465262967678951
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
3.983 × 10⁹³(94-digit number)
39838995751808304305…56125465262967678951
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.967 × 10⁹³(94-digit number)
79677991503616608610…12250930525935357901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.593 × 10⁹⁴(95-digit number)
15935598300723321722…24501861051870715801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.187 × 10⁹⁴(95-digit number)
31871196601446643444…49003722103741431601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.374 × 10⁹⁴(95-digit number)
63742393202893286888…98007444207482863201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.274 × 10⁹⁵(96-digit number)
12748478640578657377…96014888414965726401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.549 × 10⁹⁵(96-digit number)
25496957281157314755…92029776829931452801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.099 × 10⁹⁵(96-digit number)
50993914562314629510…84059553659862905601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.019 × 10⁹⁶(97-digit number)
10198782912462925902…68119107319725811201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.039 × 10⁹⁶(97-digit number)
20397565824925851804…36238214639451622401
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,949,817 XPM·at block #6,838,192 · 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