Block #2,123,678

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/19/2017, 10:20:11 AM · Difficulty 10.9171 · 4,714,409 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d5988e69f1c58ec07188a648bb9e20cd6f48929d3806f6429d98fca3796ef372

Height

#2,123,678

Difficulty

10.917118

Transactions

5

Size

1.55 KB

Version

2

Bits

0aeac83e

Nonce

1,617,177,141

Timestamp

5/19/2017, 10:20:11 AM

Confirmations

4,714,409

Merkle Root

89755f95a3f213a8f1d09f832ff3b5d11159f5a0333b1df1e6350709b52a0e40
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.657 × 10⁹¹(92-digit number)
26579293106744866968…67270113469300625949
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.657 × 10⁹¹(92-digit number)
26579293106744866968…67270113469300625949
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.315 × 10⁹¹(92-digit number)
53158586213489733936…34540226938601251899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.063 × 10⁹²(93-digit number)
10631717242697946787…69080453877202503799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.126 × 10⁹²(93-digit number)
21263434485395893574…38160907754405007599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.252 × 10⁹²(93-digit number)
42526868970791787148…76321815508810015199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.505 × 10⁹²(93-digit number)
85053737941583574297…52643631017620030399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.701 × 10⁹³(94-digit number)
17010747588316714859…05287262035240060799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.402 × 10⁹³(94-digit number)
34021495176633429719…10574524070480121599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.804 × 10⁹³(94-digit number)
68042990353266859438…21149048140960243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.360 × 10⁹⁴(95-digit number)
13608598070653371887…42298096281920486399
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,949,046 XPM·at block #6,838,086 · 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