Block #591,164

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/16/2014, 8:30:51 PM · Difficulty 10.9451 · 6,226,355 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1c4ec8b8d7920e477e815de5dc6a423de671406843783810b25da5c8004c5148

Height

#591,164

Difficulty

10.945060

Transactions

3

Size

1.08 KB

Version

2

Bits

0af1ef76

Nonce

20,938,628

Timestamp

6/16/2014, 8:30:51 PM

Confirmations

6,226,355

Merkle Root

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

9.015 × 10⁹⁷(98-digit number)
90159749328710090946…79497474885724748799
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
9.015 × 10⁹⁷(98-digit number)
90159749328710090946…79497474885724748799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.803 × 10⁹⁸(99-digit number)
18031949865742018189…58994949771449497599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.606 × 10⁹⁸(99-digit number)
36063899731484036378…17989899542898995199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.212 × 10⁹⁸(99-digit number)
72127799462968072757…35979799085797990399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.442 × 10⁹⁹(100-digit number)
14425559892593614551…71959598171595980799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.885 × 10⁹⁹(100-digit number)
28851119785187229102…43919196343191961599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.770 × 10⁹⁹(100-digit number)
57702239570374458205…87838392686383923199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.154 × 10¹⁰⁰(101-digit number)
11540447914074891641…75676785372767846399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.308 × 10¹⁰⁰(101-digit number)
23080895828149783282…51353570745535692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.616 × 10¹⁰⁰(101-digit number)
46161791656299566564…02707141491071385599
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,784,203 XPM·at block #6,817,518 · 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