Block #604,888

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/28/2014, 3:19:15 AM · Difficulty 10.9100 · 6,221,763 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f3fd0c2ae95d7eeab7554f1ac94da6d69bf4d65cdb8665c51133366950f122a3

Height

#604,888

Difficulty

10.909968

Transactions

11

Size

2.84 KB

Version

2

Bits

0ae8f3ae

Nonce

2,199,777,774

Timestamp

6/28/2014, 3:19:15 AM

Confirmations

6,221,763

Merkle Root

ebbf0838a51142c348d292b64c1c4f0bfe219bd1e344d478d53e2d3dab75498e
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.277 × 10¹⁰⁰(101-digit number)
12771587362811954375…66942737121290496001
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.277 × 10¹⁰⁰(101-digit number)
12771587362811954375…66942737121290496001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.554 × 10¹⁰⁰(101-digit number)
25543174725623908750…33885474242580992001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.108 × 10¹⁰⁰(101-digit number)
51086349451247817501…67770948485161984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.021 × 10¹⁰¹(102-digit number)
10217269890249563500…35541896970323968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.043 × 10¹⁰¹(102-digit number)
20434539780499127000…71083793940647936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.086 × 10¹⁰¹(102-digit number)
40869079560998254001…42167587881295872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.173 × 10¹⁰¹(102-digit number)
81738159121996508002…84335175762591744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.634 × 10¹⁰²(103-digit number)
16347631824399301600…68670351525183488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.269 × 10¹⁰²(103-digit number)
32695263648798603200…37340703050366976001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.539 × 10¹⁰²(103-digit number)
65390527297597206401…74681406100733952001
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,857,357 XPM·at block #6,826,650 · 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