Block #558,759

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/23/2014, 6:37:33 PM · Difficulty 10.9640 · 6,285,819 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3b42151ba5c69592bcdc121e02999b419d8405b8c892db3e1441bb0c68202d9e

Height

#558,759

Difficulty

10.963967

Transactions

5

Size

1.08 KB

Version

2

Bits

0af6c683

Nonce

5,362,363

Timestamp

5/23/2014, 6:37:33 PM

Confirmations

6,285,819

Merkle Root

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

5.709 × 10⁹⁹(100-digit number)
57091328984668387191…66323266247277356801
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
5.709 × 10⁹⁹(100-digit number)
57091328984668387191…66323266247277356801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.141 × 10¹⁰⁰(101-digit number)
11418265796933677438…32646532494554713601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.283 × 10¹⁰⁰(101-digit number)
22836531593867354876…65293064989109427201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.567 × 10¹⁰⁰(101-digit number)
45673063187734709753…30586129978218854401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.134 × 10¹⁰⁰(101-digit number)
91346126375469419506…61172259956437708801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.826 × 10¹⁰¹(102-digit number)
18269225275093883901…22344519912875417601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.653 × 10¹⁰¹(102-digit number)
36538450550187767802…44689039825750835201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.307 × 10¹⁰¹(102-digit number)
73076901100375535605…89378079651501670401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.461 × 10¹⁰²(103-digit number)
14615380220075107121…78756159303003340801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.923 × 10¹⁰²(103-digit number)
29230760440150214242…57512318606006681601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.846 × 10¹⁰²(103-digit number)
58461520880300428484…15024637212013363201
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 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
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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:58,001,030 XPM·at block #6,844,577 · 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