Block #587,041

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/13/2014, 12:04:51 PM · Difficulty 10.9521 · 6,219,411 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
63ea359fd8e50ebaad22174f1d9d5e72e86221d531b60890337e31f9b585e359

Height

#587,041

Difficulty

10.952056

Transactions

2

Size

582 B

Version

2

Bits

0af3b9ef

Nonce

305,416,305

Timestamp

6/13/2014, 12:04:51 PM

Confirmations

6,219,411

Merkle Root

23e3d335c6a49d433dea96870c6356bcf626df9f4563166a4f36fc0bba698594
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.575 × 10¹⁰⁰(101-digit number)
15754751037475028122…50892583308321433601
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.575 × 10¹⁰⁰(101-digit number)
15754751037475028122…50892583308321433601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.150 × 10¹⁰⁰(101-digit number)
31509502074950056244…01785166616642867201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.301 × 10¹⁰⁰(101-digit number)
63019004149900112488…03570333233285734401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.260 × 10¹⁰¹(102-digit number)
12603800829980022497…07140666466571468801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.520 × 10¹⁰¹(102-digit number)
25207601659960044995…14281332933142937601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.041 × 10¹⁰¹(102-digit number)
50415203319920089990…28562665866285875201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.008 × 10¹⁰²(103-digit number)
10083040663984017998…57125331732571750401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.016 × 10¹⁰²(103-digit number)
20166081327968035996…14250663465143500801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.033 × 10¹⁰²(103-digit number)
40332162655936071992…28501326930287001601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.066 × 10¹⁰²(103-digit number)
80664325311872143984…57002653860574003201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.613 × 10¹⁰³(104-digit number)
16132865062374428796…14005307721148006401
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,695,706 XPM·at block #6,806,451 · 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