Block #598,521

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/22/2014, 8:56:49 PM · Difficulty 10.9290 · 6,210,694 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ce5e5f5f373bec7c442a069c2e4c76b7a23e123b1ee2045892ecd6d5704c2796

Height

#598,521

Difficulty

10.929032

Transactions

2

Size

582 B

Version

2

Bits

0aedd511

Nonce

2,378,332,358

Timestamp

6/22/2014, 8:56:49 PM

Confirmations

6,210,694

Merkle Root

ce91b6621bcd03c74eb1f337b7dd1a2d4967408ec7882268c62d4bff72a97f11
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.

2.634 × 10⁹⁸(99-digit number)
26344566986378937452…32762065544601245441
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
2.634 × 10⁹⁸(99-digit number)
26344566986378937452…32762065544601245441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.268 × 10⁹⁸(99-digit number)
52689133972757874904…65524131089202490881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.053 × 10⁹⁹(100-digit number)
10537826794551574980…31048262178404981761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.107 × 10⁹⁹(100-digit number)
21075653589103149961…62096524356809963521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.215 × 10⁹⁹(100-digit number)
42151307178206299923…24193048713619927041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.430 × 10⁹⁹(100-digit number)
84302614356412599847…48386097427239854081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.686 × 10¹⁰⁰(101-digit number)
16860522871282519969…96772194854479708161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.372 × 10¹⁰⁰(101-digit number)
33721045742565039938…93544389708959416321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.744 × 10¹⁰⁰(101-digit number)
67442091485130079877…87088779417918832641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.348 × 10¹⁰¹(102-digit number)
13488418297026015975…74177558835837665281
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,717,781 XPM·at block #6,809,214 · 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