Block #2,812,207

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/27/2018, 12:42:23 PM · Difficulty 11.6692 · 4,027,200 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9872adb2f23e71a1820adb63fe8603bf50516889e74eb31510cd99918103017a

Height

#2,812,207

Difficulty

11.669212

Transactions

17

Size

6.47 KB

Version

2

Bits

0bab5178

Nonce

204,412,065

Timestamp

8/27/2018, 12:42:23 PM

Confirmations

4,027,200

Merkle Root

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

4.445 × 10⁹³(94-digit number)
44451064561903184966…96674420300479841599
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
4.445 × 10⁹³(94-digit number)
44451064561903184966…96674420300479841599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.890 × 10⁹³(94-digit number)
88902129123806369933…93348840600959683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.778 × 10⁹⁴(95-digit number)
17780425824761273986…86697681201919366399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.556 × 10⁹⁴(95-digit number)
35560851649522547973…73395362403838732799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.112 × 10⁹⁴(95-digit number)
71121703299045095946…46790724807677465599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.422 × 10⁹⁵(96-digit number)
14224340659809019189…93581449615354931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.844 × 10⁹⁵(96-digit number)
28448681319618038378…87162899230709862399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.689 × 10⁹⁵(96-digit number)
56897362639236076757…74325798461419724799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.137 × 10⁹⁶(97-digit number)
11379472527847215351…48651596922839449599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.275 × 10⁹⁶(97-digit number)
22758945055694430703…97303193845678899199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.551 × 10⁹⁶(97-digit number)
45517890111388861406…94606387691357798399
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,959,543 XPM·at block #6,839,406 · 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