Block #1,598,597

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/24/2016, 9:24:36 PM · Difficulty 10.6109 · 5,215,271 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
78011b66fb989b358f6bbe01e776a3ccda1ee400b8bb49c143e5dc6b3187a8c1

Height

#1,598,597

Difficulty

10.610914

Transactions

5

Size

76.65 KB

Version

2

Bits

0a9c64d6

Nonce

638,251,036

Timestamp

5/24/2016, 9:24:36 PM

Confirmations

5,215,271

Merkle Root

627ee4daba0a90f00c46e0c73513e4f2676790825774b68ef175b624f0e88ef3
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.453 × 10⁹⁷(98-digit number)
14531928400287321153…73400307519298396159
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.453 × 10⁹⁷(98-digit number)
14531928400287321153…73400307519298396159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.906 × 10⁹⁷(98-digit number)
29063856800574642306…46800615038596792319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.812 × 10⁹⁷(98-digit number)
58127713601149284613…93601230077193584639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.162 × 10⁹⁸(99-digit number)
11625542720229856922…87202460154387169279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.325 × 10⁹⁸(99-digit number)
23251085440459713845…74404920308774338559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.650 × 10⁹⁸(99-digit number)
46502170880919427690…48809840617548677119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.300 × 10⁹⁸(99-digit number)
93004341761838855381…97619681235097354239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.860 × 10⁹⁹(100-digit number)
18600868352367771076…95239362470194708479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.720 × 10⁹⁹(100-digit number)
37201736704735542152…90478724940389416959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.440 × 10⁹⁹(100-digit number)
74403473409471084305…80957449880778833919
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,755,017 XPM·at block #6,813,867 · 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