Block #562,204

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/25/2014, 11:20:08 PM · Difficulty 10.9660 · 6,246,618 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
598bd8629c73b401a4d3b881910b44a6a98a780c47808b323eba68f44b84808a

Height

#562,204

Difficulty

10.966034

Transactions

8

Size

2.18 KB

Version

2

Bits

0af74e04

Nonce

1,821,613,835

Timestamp

5/25/2014, 11:20:08 PM

Confirmations

6,246,618

Merkle Root

827a8cdc9f624accdbe26b0fd9c2e6b873afce5454ecad73a72752332d2531a5
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.

4.654 × 10⁹⁷(98-digit number)
46548309604400213486…47950878241779567159
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
4.654 × 10⁹⁷(98-digit number)
46548309604400213486…47950878241779567159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.309 × 10⁹⁷(98-digit number)
93096619208800426972…95901756483559134319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.861 × 10⁹⁸(99-digit number)
18619323841760085394…91803512967118268639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.723 × 10⁹⁸(99-digit number)
37238647683520170788…83607025934236537279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.447 × 10⁹⁸(99-digit number)
74477295367040341577…67214051868473074559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.489 × 10⁹⁹(100-digit number)
14895459073408068315…34428103736946149119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.979 × 10⁹⁹(100-digit number)
29790918146816136631…68856207473892298239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.958 × 10⁹⁹(100-digit number)
59581836293632273262…37712414947784596479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.191 × 10¹⁰⁰(101-digit number)
11916367258726454652…75424829895569192959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.383 × 10¹⁰⁰(101-digit number)
23832734517452909304…50849659791138385919
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,714,633 XPM·at block #6,808,821 · 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