Block #2,868,214

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/5/2018, 10:38:30 AM · Difficulty 11.6695 · 3,965,790 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7728133f8903f9935fbb5c277c46bd3fac6ea117c4689ab02fe85c18036483b8

Height

#2,868,214

Difficulty

11.669539

Transactions

4

Size

1.30 KB

Version

2

Bits

0bab66e8

Nonce

605,878,323

Timestamp

10/5/2018, 10:38:30 AM

Confirmations

3,965,790

Merkle Root

9aca5bb944c46c8bc7d5f5c51aba180d172f77ae9801f647c278c546030de1bf
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.719 × 10⁹¹(92-digit number)
47199677269501868674…89284860856319485259
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.719 × 10⁹¹(92-digit number)
47199677269501868674…89284860856319485259
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.439 × 10⁹¹(92-digit number)
94399354539003737348…78569721712638970519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.887 × 10⁹²(93-digit number)
18879870907800747469…57139443425277941039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.775 × 10⁹²(93-digit number)
37759741815601494939…14278886850555882079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.551 × 10⁹²(93-digit number)
75519483631202989878…28557773701111764159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.510 × 10⁹³(94-digit number)
15103896726240597975…57115547402223528319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.020 × 10⁹³(94-digit number)
30207793452481195951…14231094804447056639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.041 × 10⁹³(94-digit number)
60415586904962391902…28462189608894113279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.208 × 10⁹⁴(95-digit number)
12083117380992478380…56924379217788226559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.416 × 10⁹⁴(95-digit number)
24166234761984956761…13848758435576453119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.833 × 10⁹⁴(95-digit number)
48332469523969913522…27697516871152906239
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,916,259 XPM·at block #6,834,003 · 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