Block #2,266,593

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/25/2017, 12:48:22 AM · Difficulty 10.9516 · 4,550,536 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9c9f2363613e68001ee491943509c0fbc53739aad7f7acb454973ae5ad7157c0

Height

#2,266,593

Difficulty

10.951609

Transactions

2

Size

869 B

Version

2

Bits

0af39cab

Nonce

323,333,267

Timestamp

8/25/2017, 12:48:22 AM

Confirmations

4,550,536

Merkle Root

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

6.837 × 10⁹³(94-digit number)
68376829982960232861…58238263837681561601
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.837 × 10⁹³(94-digit number)
68376829982960232861…58238263837681561601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.367 × 10⁹⁴(95-digit number)
13675365996592046572…16476527675363123201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.735 × 10⁹⁴(95-digit number)
27350731993184093144…32953055350726246401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.470 × 10⁹⁴(95-digit number)
54701463986368186289…65906110701452492801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.094 × 10⁹⁵(96-digit number)
10940292797273637257…31812221402904985601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.188 × 10⁹⁵(96-digit number)
21880585594547274515…63624442805809971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.376 × 10⁹⁵(96-digit number)
43761171189094549031…27248885611619942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.752 × 10⁹⁵(96-digit number)
87522342378189098062…54497771223239884801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.750 × 10⁹⁶(97-digit number)
17504468475637819612…08995542446479769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.500 × 10⁹⁶(97-digit number)
35008936951275639225…17991084892959539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.001 × 10⁹⁶(97-digit number)
70017873902551278450…35982169785919078401
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,781,066 XPM·at block #6,817,128 · 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