Block #588,103

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/14/2014, 9:12:07 AM · Difficulty 10.9501 · 6,238,640 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
189f856928852b9d8e3ef8ba0398f2c47f4ade3632ad57012519fe30d3871b0d

Height

#588,103

Difficulty

10.950117

Transactions

6

Size

1.31 KB

Version

2

Bits

0af33ae5

Nonce

1,757,480,651

Timestamp

6/14/2014, 9:12:07 AM

Confirmations

6,238,640

Merkle Root

fe7f64d8d61ab593578342b42f5c545998186b3e4f43ec93c2dc056a4bf6e138
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.594 × 10⁹⁹(100-digit number)
55944107343360695238…07682351619219159039
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.594 × 10⁹⁹(100-digit number)
55944107343360695238…07682351619219159039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.118 × 10¹⁰⁰(101-digit number)
11188821468672139047…15364703238438318079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.237 × 10¹⁰⁰(101-digit number)
22377642937344278095…30729406476876636159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.475 × 10¹⁰⁰(101-digit number)
44755285874688556190…61458812953753272319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.951 × 10¹⁰⁰(101-digit number)
89510571749377112381…22917625907506544639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.790 × 10¹⁰¹(102-digit number)
17902114349875422476…45835251815013089279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.580 × 10¹⁰¹(102-digit number)
35804228699750844952…91670503630026178559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.160 × 10¹⁰¹(102-digit number)
71608457399501689905…83341007260052357119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.432 × 10¹⁰²(103-digit number)
14321691479900337981…66682014520104714239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.864 × 10¹⁰²(103-digit number)
28643382959800675962…33364029040209428479
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,858,100 XPM·at block #6,826,742 · 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