Block #589,325

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/15/2014, 9:34:53 AM · Difficulty 10.9477 · 6,217,245 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fcb9790e07c81a76d4f2dd0891ff48cfa794493ec418a8adecdc024eb934c0bc

Height

#589,325

Difficulty

10.947704

Transactions

2

Size

400 B

Version

2

Bits

0af29cc0

Nonce

1,013,484,919

Timestamp

6/15/2014, 9:34:53 AM

Confirmations

6,217,245

Merkle Root

695f46461d902715acbddfd1c7b5393d1f635a7b8bd6adc2ed6cea6e0269bce1
Transactions (2)
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.579 × 10⁹⁹(100-digit number)
15798201992227090642…15657009359350205441
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.579 × 10⁹⁹(100-digit number)
15798201992227090642…15657009359350205441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.159 × 10⁹⁹(100-digit number)
31596403984454181285…31314018718700410881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.319 × 10⁹⁹(100-digit number)
63192807968908362571…62628037437400821761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.263 × 10¹⁰⁰(101-digit number)
12638561593781672514…25256074874801643521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.527 × 10¹⁰⁰(101-digit number)
25277123187563345028…50512149749603287041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.055 × 10¹⁰⁰(101-digit number)
50554246375126690057…01024299499206574081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.011 × 10¹⁰¹(102-digit number)
10110849275025338011…02048598998413148161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.022 × 10¹⁰¹(102-digit number)
20221698550050676023…04097197996826296321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.044 × 10¹⁰¹(102-digit number)
40443397100101352046…08194395993652592641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.088 × 10¹⁰¹(102-digit number)
80886794200202704092…16388791987305185281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.617 × 10¹⁰²(103-digit number)
16177358840040540818…32777583974610370561
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,696,657 XPM·at block #6,806,569 · 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