Block #559,018

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/23/2014, 10:27:26 PM · Difficulty 10.9642 · 6,284,172 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fe692bc9a4b1237443f32b8d55c66bfc1fe624bd8da6e9894c109bfb972e3a1c

Height

#559,018

Difficulty

10.964175

Transactions

6

Size

1.45 KB

Version

2

Bits

0af6d42b

Nonce

538,031,171

Timestamp

5/23/2014, 10:27:26 PM

Confirmations

6,284,172

Merkle Root

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

6.976 × 10⁹⁷(98-digit number)
69761994251439665049…41949421478716472479
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
6.976 × 10⁹⁷(98-digit number)
69761994251439665049…41949421478716472479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.395 × 10⁹⁸(99-digit number)
13952398850287933009…83898842957432944959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.790 × 10⁹⁸(99-digit number)
27904797700575866019…67797685914865889919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.580 × 10⁹⁸(99-digit number)
55809595401151732039…35595371829731779839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.116 × 10⁹⁹(100-digit number)
11161919080230346407…71190743659463559679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.232 × 10⁹⁹(100-digit number)
22323838160460692815…42381487318927119359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.464 × 10⁹⁹(100-digit number)
44647676320921385631…84762974637854238719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.929 × 10⁹⁹(100-digit number)
89295352641842771263…69525949275708477439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.785 × 10¹⁰⁰(101-digit number)
17859070528368554252…39051898551416954879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.571 × 10¹⁰⁰(101-digit number)
35718141056737108505…78103797102833909759
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,989,889 XPM·at block #6,843,189 · 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