Block #586,021

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/12/2014, 5:11:41 PM · Difficulty 10.9531 · 6,225,083 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e34d88c7b70c99289bfe616c9b7e45cdca999a6b86070001b055661142356604

Height

#586,021

Difficulty

10.953090

Transactions

4

Size

1.01 KB

Version

2

Bits

0af3fdb3

Nonce

24,423,129

Timestamp

6/12/2014, 5:11:41 PM

Confirmations

6,225,083

Merkle Root

8116f9412cb8129eccc61796e1cacb35bae2673c867944960e50356bd7ca74f0
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.

1.539 × 10⁹⁹(100-digit number)
15392651607989010891…36261072379760770561
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
1.539 × 10⁹⁹(100-digit number)
15392651607989010891…36261072379760770561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.078 × 10⁹⁹(100-digit number)
30785303215978021783…72522144759521541121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.157 × 10⁹⁹(100-digit number)
61570606431956043567…45044289519043082241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.231 × 10¹⁰⁰(101-digit number)
12314121286391208713…90088579038086164481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.462 × 10¹⁰⁰(101-digit number)
24628242572782417427…80177158076172328961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.925 × 10¹⁰⁰(101-digit number)
49256485145564834854…60354316152344657921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.851 × 10¹⁰⁰(101-digit number)
98512970291129669708…20708632304689315841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.970 × 10¹⁰¹(102-digit number)
19702594058225933941…41417264609378631681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.940 × 10¹⁰¹(102-digit number)
39405188116451867883…82834529218757263361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.881 × 10¹⁰¹(102-digit number)
78810376232903735766…65669058437514526721
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 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
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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,732,939 XPM·at block #6,811,103 · 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.

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