Block #501,589

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/19/2014, 9:24:00 PM · Difficulty 10.8043 · 6,312,952 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bd7ebecc969053c840c94b8a671e1ae0e90deb462f405453909d2bd8c4fcb7d2

Height

#501,589

Difficulty

10.804283

Transactions

6

Size

2.89 KB

Version

2

Bits

0acde582

Nonce

135,552,333

Timestamp

4/19/2014, 9:24:00 PM

Confirmations

6,312,952

Merkle Root

cb1a23f21ea2401ecdc3b88ee3634d6a0ad9e0ecaa66dc50260916b12d30fa45
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.755 × 10¹⁰⁰(101-digit number)
17550380687897395451…63797424168198983679
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.755 × 10¹⁰⁰(101-digit number)
17550380687897395451…63797424168198983679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.510 × 10¹⁰⁰(101-digit number)
35100761375794790903…27594848336397967359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.020 × 10¹⁰⁰(101-digit number)
70201522751589581806…55189696672795934719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.404 × 10¹⁰¹(102-digit number)
14040304550317916361…10379393345591869439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.808 × 10¹⁰¹(102-digit number)
28080609100635832722…20758786691183738879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.616 × 10¹⁰¹(102-digit number)
56161218201271665444…41517573382367477759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.123 × 10¹⁰²(103-digit number)
11232243640254333088…83035146764734955519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.246 × 10¹⁰²(103-digit number)
22464487280508666177…66070293529469911039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.492 × 10¹⁰²(103-digit number)
44928974561017332355…32140587058939822079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.985 × 10¹⁰²(103-digit number)
89857949122034664711…64281174117879644159
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,760,399 XPM·at block #6,814,540 · 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