Block #555,644

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/21/2014, 5:02:05 PM · Difficulty 10.9629 · 6,262,182 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
438f7f4b69dd9cb7bfc234586f632d9a852dd2afca33285390859ec9bd861db4

Height

#555,644

Difficulty

10.962874

Transactions

7

Size

2.22 KB

Version

2

Bits

0af67ee5

Nonce

141,629,536

Timestamp

5/21/2014, 5:02:05 PM

Confirmations

6,262,182

Merkle Root

cef5562f256cbf6307ab7f6835df3da6fe654213b18e76092131acfe5af514e1
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.248 × 10⁹⁸(99-digit number)
12482240897437206108…52329365154650871341
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.248 × 10⁹⁸(99-digit number)
12482240897437206108…52329365154650871341
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.496 × 10⁹⁸(99-digit number)
24964481794874412216…04658730309301742681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.992 × 10⁹⁸(99-digit number)
49928963589748824433…09317460618603485361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.985 × 10⁹⁸(99-digit number)
99857927179497648867…18634921237206970721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.997 × 10⁹⁹(100-digit number)
19971585435899529773…37269842474413941441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.994 × 10⁹⁹(100-digit number)
39943170871799059547…74539684948827882881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.988 × 10⁹⁹(100-digit number)
79886341743598119094…49079369897655765761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.597 × 10¹⁰⁰(101-digit number)
15977268348719623818…98158739795311531521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.195 × 10¹⁰⁰(101-digit number)
31954536697439247637…96317479590623063041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.390 × 10¹⁰⁰(101-digit number)
63909073394878495275…92634959181246126081
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,786,672 XPM·at block #6,817,825 · 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