Block #528,899

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/6/2014, 10:06:00 PM · Difficulty 10.8887 · 6,288,879 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c4fbcd7ebaa00f8f21f83f4fca19bca7ccf356e48c835267609070ebdc6af156

Height

#528,899

Difficulty

10.888726

Transactions

9

Size

2.14 KB

Version

2

Bits

0ae38384

Nonce

67,118,701

Timestamp

5/6/2014, 10:06:00 PM

Confirmations

6,288,879

Merkle Root

07806447814e04de6978825c677617ffa3d08d8063c99564bf0d5623087e53dc
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.

5.044 × 10⁹⁹(100-digit number)
50442754636203133958…69299007163898092799
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
5.044 × 10⁹⁹(100-digit number)
50442754636203133958…69299007163898092799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.008 × 10¹⁰⁰(101-digit number)
10088550927240626791…38598014327796185599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.017 × 10¹⁰⁰(101-digit number)
20177101854481253583…77196028655592371199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.035 × 10¹⁰⁰(101-digit number)
40354203708962507166…54392057311184742399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.070 × 10¹⁰⁰(101-digit number)
80708407417925014333…08784114622369484799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.614 × 10¹⁰¹(102-digit number)
16141681483585002866…17568229244738969599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.228 × 10¹⁰¹(102-digit number)
32283362967170005733…35136458489477939199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.456 × 10¹⁰¹(102-digit number)
64566725934340011466…70272916978955878399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.291 × 10¹⁰²(103-digit number)
12913345186868002293…40545833957911756799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.582 × 10¹⁰²(103-digit number)
25826690373736004586…81091667915823513599
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,786,282 XPM·at block #6,817,777 · 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