Block #2,032,543

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/21/2017, 4:11:41 PM · Difficulty 10.6896 · 4,780,034 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8959d4c688bf23192be4f4a347ddbe1087e26841b1e139e282bd12f237e14f40

Height

#2,032,543

Difficulty

10.689556

Transactions

2

Size

3.70 KB

Version

2

Bits

0ab086c1

Nonce

1,487,484,953

Timestamp

3/21/2017, 4:11:41 PM

Confirmations

4,780,034

Merkle Root

87664071bb6a1d8932f864948c99b982d39d3e202a81a70618b4e13b5d5ac1d1
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.384 × 10⁹⁵(96-digit number)
23841071051373969368…54015036017161075199
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.384 × 10⁹⁵(96-digit number)
23841071051373969368…54015036017161075199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.768 × 10⁹⁵(96-digit number)
47682142102747938736…08030072034322150399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.536 × 10⁹⁵(96-digit number)
95364284205495877473…16060144068644300799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.907 × 10⁹⁶(97-digit number)
19072856841099175494…32120288137288601599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.814 × 10⁹⁶(97-digit number)
38145713682198350989…64240576274577203199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.629 × 10⁹⁶(97-digit number)
76291427364396701979…28481152549154406399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.525 × 10⁹⁷(98-digit number)
15258285472879340395…56962305098308812799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.051 × 10⁹⁷(98-digit number)
30516570945758680791…13924610196617625599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.103 × 10⁹⁷(98-digit number)
61033141891517361583…27849220393235251199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.220 × 10⁹⁸(99-digit number)
12206628378303472316…55698440786470502399
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,744,650 XPM·at block #6,812,576 · 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.

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