Block #589,654

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/15/2014, 3:35:32 PM · Difficulty 10.9474 · 6,227,947 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bea92ee5221b34cbc8f94769c58322c21ca9627d3566fdfdfa95afeefd935f41

Height

#589,654

Difficulty

10.947381

Transactions

5

Size

1.37 KB

Version

2

Bits

0af2878b

Nonce

114,967,593

Timestamp

6/15/2014, 3:35:32 PM

Confirmations

6,227,947

Merkle Root

953c45868a61a2de990100881fc435340995fc500c22ed80dfde96e341bcbe91
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.824 × 10⁹⁷(98-digit number)
38248922543066000224…10858325483855178121
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.824 × 10⁹⁷(98-digit number)
38248922543066000224…10858325483855178121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.649 × 10⁹⁷(98-digit number)
76497845086132000449…21716650967710356241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.529 × 10⁹⁸(99-digit number)
15299569017226400089…43433301935420712481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.059 × 10⁹⁸(99-digit number)
30599138034452800179…86866603870841424961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.119 × 10⁹⁸(99-digit number)
61198276068905600359…73733207741682849921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.223 × 10⁹⁹(100-digit number)
12239655213781120071…47466415483365699841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.447 × 10⁹⁹(100-digit number)
24479310427562240143…94932830966731399681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.895 × 10⁹⁹(100-digit number)
48958620855124480287…89865661933462799361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.791 × 10⁹⁹(100-digit number)
97917241710248960575…79731323866925598721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.958 × 10¹⁰⁰(101-digit number)
19583448342049792115…59462647733851197441
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,784,862 XPM·at block #6,817,600 · 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