Block #2,823,508

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/3/2018, 11:19:16 PM · Difficulty 11.7058 · 4,019,473 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5da5350f90b69122efa3f04e6241b64a15951799894c5805e0b0c4c0cf8046be

Height

#2,823,508

Difficulty

11.705805

Transactions

18

Size

6.45 KB

Version

2

Bits

0bb4afa1

Nonce

218,561,243

Timestamp

9/3/2018, 11:19:16 PM

Confirmations

4,019,473

Merkle Root

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

3.944 × 10⁹⁴(95-digit number)
39444545758176822744…44750707592438005759
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
3.944 × 10⁹⁴(95-digit number)
39444545758176822744…44750707592438005759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.888 × 10⁹⁴(95-digit number)
78889091516353645488…89501415184876011519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.577 × 10⁹⁵(96-digit number)
15777818303270729097…79002830369752023039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.155 × 10⁹⁵(96-digit number)
31555636606541458195…58005660739504046079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.311 × 10⁹⁵(96-digit number)
63111273213082916390…16011321479008092159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.262 × 10⁹⁶(97-digit number)
12622254642616583278…32022642958016184319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.524 × 10⁹⁶(97-digit number)
25244509285233166556…64045285916032368639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.048 × 10⁹⁶(97-digit number)
50489018570466333112…28090571832064737279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.009 × 10⁹⁷(98-digit number)
10097803714093266622…56181143664129474559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.019 × 10⁹⁷(98-digit number)
20195607428186533244…12362287328258949119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.039 × 10⁹⁷(98-digit number)
40391214856373066489…24724574656517898239
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,988,202 XPM·at block #6,842,980 · 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