Block #589,624

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/15/2014, 3:06:01 PM · Difficulty 10.9474 · 6,220,618 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bc91f05d8e4f1962334cbf3ffab1557a38bfe3f4cd52d4987832a31a582e5d3e

Height

#589,624

Difficulty

10.947394

Transactions

7

Size

1.67 KB

Version

2

Bits

0af28864

Nonce

233,784,312

Timestamp

6/15/2014, 3:06:01 PM

Confirmations

6,220,618

Merkle Root

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

8.492 × 10⁹⁷(98-digit number)
84925602726677634663…68796721258555579601
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
8.492 × 10⁹⁷(98-digit number)
84925602726677634663…68796721258555579601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.698 × 10⁹⁸(99-digit number)
16985120545335526932…37593442517111159201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.397 × 10⁹⁸(99-digit number)
33970241090671053865…75186885034222318401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.794 × 10⁹⁸(99-digit number)
67940482181342107730…50373770068444636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.358 × 10⁹⁹(100-digit number)
13588096436268421546…00747540136889273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.717 × 10⁹⁹(100-digit number)
27176192872536843092…01495080273778547201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.435 × 10⁹⁹(100-digit number)
54352385745073686184…02990160547557094401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.087 × 10¹⁰⁰(101-digit number)
10870477149014737236…05980321095114188801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.174 × 10¹⁰⁰(101-digit number)
21740954298029474473…11960642190228377601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.348 × 10¹⁰⁰(101-digit number)
43481908596058948947…23921284380456755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.696 × 10¹⁰⁰(101-digit number)
86963817192117897894…47842568760913510401
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:57,726,007 XPM·at block #6,810,241 · 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