Block #2,686,198

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/31/2018, 7:06:57 PM · Difficulty 11.6860 · 4,157,065 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e77bf997523d29cdc33a842728ee3f2e27e51b4fb86ac97ad986d308a4012ab1

Height

#2,686,198

Difficulty

11.686041

Transactions

29

Size

9.80 KB

Version

2

Bits

0bafa061

Nonce

187,172,617

Timestamp

5/31/2018, 7:06:57 PM

Confirmations

4,157,065

Merkle Root

cc9f7dd044de247b7d046579f8e4787dfec43ef7547878db82cf9781c5db6426
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.736 × 10⁹⁵(96-digit number)
27363351534022539688…39024628141668730559
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.736 × 10⁹⁵(96-digit number)
27363351534022539688…39024628141668730559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.472 × 10⁹⁵(96-digit number)
54726703068045079376…78049256283337461119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.094 × 10⁹⁶(97-digit number)
10945340613609015875…56098512566674922239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.189 × 10⁹⁶(97-digit number)
21890681227218031750…12197025133349844479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.378 × 10⁹⁶(97-digit number)
43781362454436063500…24394050266699688959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.756 × 10⁹⁶(97-digit number)
87562724908872127001…48788100533399377919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.751 × 10⁹⁷(98-digit number)
17512544981774425400…97576201066798755839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.502 × 10⁹⁷(98-digit number)
35025089963548850800…95152402133597511679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.005 × 10⁹⁷(98-digit number)
70050179927097701601…90304804267195023359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.401 × 10⁹⁸(99-digit number)
14010035985419540320…80609608534390046719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.802 × 10⁹⁸(99-digit number)
28020071970839080640…61219217068780093439
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,990,478 XPM·at block #6,843,262 · 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