Block #597,890

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/22/2014, 8:08:38 AM · Difficulty 10.9309 · 6,229,071 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
38780efcb31be5cddd45eda942b76581af86e665c58bd48f762b92dd08a320e0

Height

#597,890

Difficulty

10.930900

Transactions

8

Size

69.25 KB

Version

2

Bits

0aee4f77

Nonce

115,916,052

Timestamp

6/22/2014, 8:08:38 AM

Confirmations

6,229,071

Merkle Root

d81b71b79d4891cc4961810d6b7d88bc95cf9a1d0d9d8742bb285b01e34f089a
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.

2.713 × 10⁹⁸(99-digit number)
27132350238024446690…48703046421170142719
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
2.713 × 10⁹⁸(99-digit number)
27132350238024446690…48703046421170142719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.426 × 10⁹⁸(99-digit number)
54264700476048893381…97406092842340285439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.085 × 10⁹⁹(100-digit number)
10852940095209778676…94812185684680570879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.170 × 10⁹⁹(100-digit number)
21705880190419557352…89624371369361141759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.341 × 10⁹⁹(100-digit number)
43411760380839114705…79248742738722283519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.682 × 10⁹⁹(100-digit number)
86823520761678229410…58497485477444567039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.736 × 10¹⁰⁰(101-digit number)
17364704152335645882…16994970954889134079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.472 × 10¹⁰⁰(101-digit number)
34729408304671291764…33989941909778268159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.945 × 10¹⁰⁰(101-digit number)
69458816609342583528…67979883819556536319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.389 × 10¹⁰¹(102-digit number)
13891763321868516705…35959767639113072639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.778 × 10¹⁰¹(102-digit number)
27783526643737033411…71919535278226145279
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,859,864 XPM·at block #6,826,960 · 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