Block #2,582,562

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/24/2018, 8:18:50 AM · Difficulty 11.1347 · 4,253,930 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8385934c8a8c816c4a552777294d19c7cad28f92c663a3ce7b963cb7180824f1

Height

#2,582,562

Difficulty

11.134727

Transactions

5

Size

1.38 KB

Version

2

Bits

0b227d80

Nonce

328,234,095

Timestamp

3/24/2018, 8:18:50 AM

Confirmations

4,253,930

Merkle Root

1724f19c2343100f0fb336e524d147f96d60d10ca7540d92487adee305872f08
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.090 × 10⁹⁵(96-digit number)
60906000538751933039…80336334887912983039
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.090 × 10⁹⁵(96-digit number)
60906000538751933039…80336334887912983039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.218 × 10⁹⁶(97-digit number)
12181200107750386607…60672669775825966079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.436 × 10⁹⁶(97-digit number)
24362400215500773215…21345339551651932159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.872 × 10⁹⁶(97-digit number)
48724800431001546431…42690679103303864319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.744 × 10⁹⁶(97-digit number)
97449600862003092862…85381358206607728639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.948 × 10⁹⁷(98-digit number)
19489920172400618572…70762716413215457279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.897 × 10⁹⁷(98-digit number)
38979840344801237145…41525432826430914559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.795 × 10⁹⁷(98-digit number)
77959680689602474290…83050865652861829119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.559 × 10⁹⁸(99-digit number)
15591936137920494858…66101731305723658239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.118 × 10⁹⁸(99-digit number)
31183872275840989716…32203462611447316479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.236 × 10⁹⁸(99-digit number)
62367744551681979432…64406925222894632959
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,936,209 XPM·at block #6,836,491 · 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