Block #589,630

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/15/2014, 3:19:12 PM · Difficulty 10.9473 · 6,221,234 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
95fa2c06fea9ae3e71fe5277236ea1d97ff96b963537a161a49d2f6af771aec7

Height

#589,630

Difficulty

10.947309

Transactions

5

Size

1.38 KB

Version

2

Bits

0af282d7

Nonce

491,541,376

Timestamp

6/15/2014, 3:19:12 PM

Confirmations

6,221,234

Merkle Root

af15b8e383c2ede87de65349fd2ca1c2453f52f1f6cec543eded690113ab47db
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.254 × 10¹⁰⁰(101-digit number)
22543853922259469172…89249195206572718081
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.254 × 10¹⁰⁰(101-digit number)
22543853922259469172…89249195206572718081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.508 × 10¹⁰⁰(101-digit number)
45087707844518938345…78498390413145436161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.017 × 10¹⁰⁰(101-digit number)
90175415689037876690…56996780826290872321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.803 × 10¹⁰¹(102-digit number)
18035083137807575338…13993561652581744641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.607 × 10¹⁰¹(102-digit number)
36070166275615150676…27987123305163489281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.214 × 10¹⁰¹(102-digit number)
72140332551230301352…55974246610326978561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.442 × 10¹⁰²(103-digit number)
14428066510246060270…11948493220653957121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.885 × 10¹⁰²(103-digit number)
28856133020492120540…23896986441307914241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.771 × 10¹⁰²(103-digit number)
57712266040984241081…47793972882615828481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.154 × 10¹⁰³(104-digit number)
11542453208196848216…95587945765231656961
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,731,008 XPM·at block #6,810,863 · 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