Block #1,584,348

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/14/2016, 2:42:26 PM · Difficulty 10.6505 · 5,257,835 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
340cca7c6d66b664736699984c301d36d5b4a7a6c044d11a7564e1d4b19a1970

Height

#1,584,348

Difficulty

10.650515

Transactions

2

Size

1.28 KB

Version

2

Bits

0aa68824

Nonce

1,586,072,950

Timestamp

5/14/2016, 2:42:26 PM

Confirmations

5,257,835

Merkle Root

9ff37d41529b4fca8ddd63d9bc5e1ca80eb9fb4862468fc4d2b27fa3aa8a1f97
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.

2.872 × 10⁹⁴(95-digit number)
28725506846166536707…90149788925075050079
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
2.872 × 10⁹⁴(95-digit number)
28725506846166536707…90149788925075050079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.745 × 10⁹⁴(95-digit number)
57451013692333073415…80299577850150100159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.149 × 10⁹⁵(96-digit number)
11490202738466614683…60599155700300200319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.298 × 10⁹⁵(96-digit number)
22980405476933229366…21198311400600400639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.596 × 10⁹⁵(96-digit number)
45960810953866458732…42396622801200801279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.192 × 10⁹⁵(96-digit number)
91921621907732917465…84793245602401602559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.838 × 10⁹⁶(97-digit number)
18384324381546583493…69586491204803205119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.676 × 10⁹⁶(97-digit number)
36768648763093166986…39172982409606410239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.353 × 10⁹⁶(97-digit number)
73537297526186333972…78345964819212820479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.470 × 10⁹⁷(98-digit number)
14707459505237266794…56691929638425640959
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 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
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 1CC formula:

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