Block #2,282,373

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/4/2017, 5:21:33 PM · Difficulty 10.9557 · 4,558,596 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e8e04657a93652c0171509958791dfa1e7cf96b78dcb55614ec5b4764e16ada0

Height

#2,282,373

Difficulty

10.955653

Transactions

69

Size

20.34 KB

Version

2

Bits

0af4a5b0

Nonce

155,785,368

Timestamp

9/4/2017, 5:21:33 PM

Confirmations

4,558,596

Merkle Root

3e4de505537b75131511d60d6c554393bd333883276d2347f5295ac37b292dd3
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.

7.314 × 10⁹⁵(96-digit number)
73143663027765463595…72397656625221210879
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
7.314 × 10⁹⁵(96-digit number)
73143663027765463595…72397656625221210879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.462 × 10⁹⁶(97-digit number)
14628732605553092719…44795313250442421759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.925 × 10⁹⁶(97-digit number)
29257465211106185438…89590626500884843519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.851 × 10⁹⁶(97-digit number)
58514930422212370876…79181253001769687039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.170 × 10⁹⁷(98-digit number)
11702986084442474175…58362506003539374079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.340 × 10⁹⁷(98-digit number)
23405972168884948350…16725012007078748159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.681 × 10⁹⁷(98-digit number)
46811944337769896701…33450024014157496319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.362 × 10⁹⁷(98-digit number)
93623888675539793402…66900048028314992639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.872 × 10⁹⁸(99-digit number)
18724777735107958680…33800096056629985279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.744 × 10⁹⁸(99-digit number)
37449555470215917361…67600192113259970559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.489 × 10⁹⁸(99-digit number)
74899110940431834722…35200384226519941119
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,972,109 XPM·at block #6,840,968 · 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