Block #2,817,086

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/30/2018, 4:02:48 PM · Difficulty 11.6921 · 4,026,147 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
68162c9d4065a835365ba1ce65be3af26612906d5876ad70eb820275ee675596

Height

#2,817,086

Difficulty

11.692108

Transactions

4

Size

2.25 KB

Version

2

Bits

0bb12dfc

Nonce

1,170,490,153

Timestamp

8/30/2018, 4:02:48 PM

Confirmations

4,026,147

Merkle Root

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

8.067 × 10⁹⁶(97-digit number)
80678429000594666304…30876826910072831999
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
8.067 × 10⁹⁶(97-digit number)
80678429000594666304…30876826910072831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.613 × 10⁹⁷(98-digit number)
16135685800118933260…61753653820145663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.227 × 10⁹⁷(98-digit number)
32271371600237866521…23507307640291327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.454 × 10⁹⁷(98-digit number)
64542743200475733043…47014615280582655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.290 × 10⁹⁸(99-digit number)
12908548640095146608…94029230561165311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.581 × 10⁹⁸(99-digit number)
25817097280190293217…88058461122330623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.163 × 10⁹⁸(99-digit number)
51634194560380586434…76116922244661247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.032 × 10⁹⁹(100-digit number)
10326838912076117286…52233844489322495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.065 × 10⁹⁹(100-digit number)
20653677824152234573…04467688978644991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.130 × 10⁹⁹(100-digit number)
41307355648304469147…08935377957289983999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.261 × 10⁹⁹(100-digit number)
82614711296608938295…17870755914579967999
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,239 XPM·at block #6,843,232 · 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