Block #1,598,331

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/24/2016, 4:59:23 PM · Difficulty 10.6108 · 5,209,941 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8594f08e724693073767f924eb436cfe53e565117d10fb779df75004ffe30729

Height

#1,598,331

Difficulty

10.610834

Transactions

4

Size

14.48 KB

Version

2

Bits

0a9c5f9d

Nonce

192,897,732

Timestamp

5/24/2016, 4:59:23 PM

Confirmations

5,209,941

Merkle Root

2bce459d28ef4ff62ef4f3cd2940648438677d982309058bcd8873412a11b122
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.

5.313 × 10⁹⁴(95-digit number)
53135373637810109118…07869216847156800641
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
5.313 × 10⁹⁴(95-digit number)
53135373637810109118…07869216847156800641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.062 × 10⁹⁵(96-digit number)
10627074727562021823…15738433694313601281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.125 × 10⁹⁵(96-digit number)
21254149455124043647…31476867388627202561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.250 × 10⁹⁵(96-digit number)
42508298910248087295…62953734777254405121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.501 × 10⁹⁵(96-digit number)
85016597820496174590…25907469554508810241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.700 × 10⁹⁶(97-digit number)
17003319564099234918…51814939109017620481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.400 × 10⁹⁶(97-digit number)
34006639128198469836…03629878218035240961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.801 × 10⁹⁶(97-digit number)
68013278256396939672…07259756436070481921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.360 × 10⁹⁷(98-digit number)
13602655651279387934…14519512872140963841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.720 × 10⁹⁷(98-digit number)
27205311302558775868…29039025744281927681
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,710,225 XPM·at block #6,808,271 · 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