Block #2,816,293

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/30/2018, 4:19:52 AM · Difficulty 11.6865 · 4,017,705 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2e3b3270ee3d9cd2fb2a7986ed7bdd460a7bdbd9166ef2393ac303ff3e384166

Height

#2,816,293

Difficulty

11.686514

Transactions

7

Size

2.41 KB

Version

2

Bits

0bafbf68

Nonce

116,293,458

Timestamp

8/30/2018, 4:19:52 AM

Confirmations

4,017,705

Merkle Root

498738f26858be7040f37f678a5747653440d3885dc95772937945e02e2c8789
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.468 × 10⁹³(94-digit number)
34682237657865583493…33725466978230595899
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.468 × 10⁹³(94-digit number)
34682237657865583493…33725466978230595899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.936 × 10⁹³(94-digit number)
69364475315731166987…67450933956461191799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.387 × 10⁹⁴(95-digit number)
13872895063146233397…34901867912922383599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.774 × 10⁹⁴(95-digit number)
27745790126292466795…69803735825844767199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.549 × 10⁹⁴(95-digit number)
55491580252584933590…39607471651689534399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.109 × 10⁹⁵(96-digit number)
11098316050516986718…79214943303379068799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.219 × 10⁹⁵(96-digit number)
22196632101033973436…58429886606758137599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.439 × 10⁹⁵(96-digit number)
44393264202067946872…16859773213516275199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.878 × 10⁹⁵(96-digit number)
88786528404135893744…33719546427032550399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.775 × 10⁹⁶(97-digit number)
17757305680827178748…67439092854065100799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.551 × 10⁹⁶(97-digit number)
35514611361654357497…34878185708130201599
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,211 XPM·at block #6,833,997 · 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