Block #2,225,389

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/27/2017, 3:03:04 PM · Difficulty 10.9474 · 4,599,901 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b58a996b750e1b934a4ba08c4471d86929189373df679812fa2db1a243309eeb

Height

#2,225,389

Difficulty

10.947417

Transactions

19

Size

5.01 KB

Version

2

Bits

0af289e5

Nonce

1,584,732,802

Timestamp

7/27/2017, 3:03:04 PM

Confirmations

4,599,901

Merkle Root

02b8e35a8fa60e9b50793c6c3285e2296f1d57d017a42fb4001b67489b08dcff
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.786 × 10⁹⁵(96-digit number)
17862174845214918874…54141277404521312001
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.786 × 10⁹⁵(96-digit number)
17862174845214918874…54141277404521312001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.572 × 10⁹⁵(96-digit number)
35724349690429837748…08282554809042624001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.144 × 10⁹⁵(96-digit number)
71448699380859675497…16565109618085248001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.428 × 10⁹⁶(97-digit number)
14289739876171935099…33130219236170496001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.857 × 10⁹⁶(97-digit number)
28579479752343870198…66260438472340992001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.715 × 10⁹⁶(97-digit number)
57158959504687740397…32520876944681984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.143 × 10⁹⁷(98-digit number)
11431791900937548079…65041753889363968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.286 × 10⁹⁷(98-digit number)
22863583801875096159…30083507778727936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.572 × 10⁹⁷(98-digit number)
45727167603750192318…60167015557455872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.145 × 10⁹⁷(98-digit number)
91454335207500384636…20334031114911744001
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,846,420 XPM·at block #6,825,289 · 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