Block #2,836,067

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/12/2018, 1:57:47 PM · Difficulty 11.7155 · 4,006,946 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9e8e26d6ede6ac5c757047ad5a84f9b5a2cff911951087f6be5505108c8c714c

Height

#2,836,067

Difficulty

11.715537

Transactions

6

Size

8.71 KB

Version

2

Bits

0bb72d76

Nonce

108,255,714

Timestamp

9/12/2018, 1:57:47 PM

Confirmations

4,006,946

Merkle Root

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

7.947 × 10⁹⁶(97-digit number)
79479820727960793550…72307164091289958399
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
7.947 × 10⁹⁶(97-digit number)
79479820727960793550…72307164091289958399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.589 × 10⁹⁷(98-digit number)
15895964145592158710…44614328182579916799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.179 × 10⁹⁷(98-digit number)
31791928291184317420…89228656365159833599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.358 × 10⁹⁷(98-digit number)
63583856582368634840…78457312730319667199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.271 × 10⁹⁸(99-digit number)
12716771316473726968…56914625460639334399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.543 × 10⁹⁸(99-digit number)
25433542632947453936…13829250921278668799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.086 × 10⁹⁸(99-digit number)
50867085265894907872…27658501842557337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.017 × 10⁹⁹(100-digit number)
10173417053178981574…55317003685114675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.034 × 10⁹⁹(100-digit number)
20346834106357963148…10634007370229350399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.069 × 10⁹⁹(100-digit number)
40693668212715926297…21268014740458700799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.138 × 10⁹⁹(100-digit number)
81387336425431852595…42536029480917401599
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,459 XPM·at block #6,843,012 · 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