Block #1,587,557

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/16/2016, 8:09:46 PM · Difficulty 10.6510 · 5,253,744 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d48b86561d5913b7385385d1aace2ea9c9563f56dd039b6e92ebf0a2d1311444

Height

#1,587,557

Difficulty

10.650987

Transactions

3

Size

5.52 KB

Version

2

Bits

0aa6a71d

Nonce

243,253,299

Timestamp

5/16/2016, 8:09:46 PM

Confirmations

5,253,744

Merkle Root

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

3.943 × 10⁹¹(92-digit number)
39436139388820128173…13832346068175913999
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
3.943 × 10⁹¹(92-digit number)
39436139388820128173…13832346068175913999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.887 × 10⁹¹(92-digit number)
78872278777640256347…27664692136351827999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.577 × 10⁹²(93-digit number)
15774455755528051269…55329384272703655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.154 × 10⁹²(93-digit number)
31548911511056102538…10658768545407311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.309 × 10⁹²(93-digit number)
63097823022112205077…21317537090814623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.261 × 10⁹³(94-digit number)
12619564604422441015…42635074181629247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.523 × 10⁹³(94-digit number)
25239129208844882031…85270148363258495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.047 × 10⁹³(94-digit number)
50478258417689764062…70540296726516991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.009 × 10⁹⁴(95-digit number)
10095651683537952812…41080593453033983999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.019 × 10⁹⁴(95-digit number)
20191303367075905624…82161186906067967999
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,974,767 XPM·at block #6,841,300 · 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