Block #2,726,215

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/29/2018, 5:24:26 AM · Difficulty 11.6245 · 4,116,912 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9a719909d9578c2a256658bf897e1a1cb346b16892980407a04e2828b0c5e91f

Height

#2,726,215

Difficulty

11.624524

Transactions

6

Size

1.49 KB

Version

2

Bits

0b9fe0cb

Nonce

19,631,637

Timestamp

6/29/2018, 5:24:26 AM

Confirmations

4,116,912

Merkle Root

345aa5235d83d6f4aae5fe78a88d83eac8541ac020f5b2961cb2468326608282
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.815 × 10⁹³(94-digit number)
78156495725775060686…44386362165086256639
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.815 × 10⁹³(94-digit number)
78156495725775060686…44386362165086256639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.563 × 10⁹⁴(95-digit number)
15631299145155012137…88772724330172513279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.126 × 10⁹⁴(95-digit number)
31262598290310024274…77545448660345026559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.252 × 10⁹⁴(95-digit number)
62525196580620048549…55090897320690053119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.250 × 10⁹⁵(96-digit number)
12505039316124009709…10181794641380106239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.501 × 10⁹⁵(96-digit number)
25010078632248019419…20363589282760212479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.002 × 10⁹⁵(96-digit number)
50020157264496038839…40727178565520424959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.000 × 10⁹⁶(97-digit number)
10004031452899207767…81454357131040849919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.000 × 10⁹⁶(97-digit number)
20008062905798415535…62908714262081699839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.001 × 10⁹⁶(97-digit number)
40016125811596831071…25817428524163399679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.003 × 10⁹⁶(97-digit number)
80032251623193662143…51634857048326799359
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,989,383 XPM·at block #6,843,126 · 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