Block #2,284,638

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/6/2017, 8:13:34 AM · Difficulty 10.9551 · 4,546,102 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1d50b74d1641b1896174a4c8da355e71396d3abcbdd6cf3046059548c7b96ab9

Height

#2,284,638

Difficulty

10.955140

Transactions

2

Size

1.72 KB

Version

2

Bits

0af4840a

Nonce

583,693,006

Timestamp

9/6/2017, 8:13:34 AM

Confirmations

4,546,102

Merkle Root

cd6e9ba10437bc9b3fc0cea5416c1fddd988b05c00d1f581af03139bbae34d70
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.108 × 10⁹⁶(97-digit number)
11089685981308455608…83719465993825402881
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.108 × 10⁹⁶(97-digit number)
11089685981308455608…83719465993825402881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.217 × 10⁹⁶(97-digit number)
22179371962616911216…67438931987650805761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.435 × 10⁹⁶(97-digit number)
44358743925233822433…34877863975301611521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.871 × 10⁹⁶(97-digit number)
88717487850467644866…69755727950603223041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.774 × 10⁹⁷(98-digit number)
17743497570093528973…39511455901206446081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.548 × 10⁹⁷(98-digit number)
35486995140187057946…79022911802412892161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.097 × 10⁹⁷(98-digit number)
70973990280374115893…58045823604825784321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.419 × 10⁹⁸(99-digit number)
14194798056074823178…16091647209651568641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.838 × 10⁹⁸(99-digit number)
28389596112149646357…32183294419303137281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.677 × 10⁹⁸(99-digit number)
56779192224299292714…64366588838606274561
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,890,057 XPM·at block #6,830,739 · 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