Block #2,662,120

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/15/2018, 1:08:05 PM · Difficulty 11.6399 · 4,179,417 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3081fb2ba2b3e3c795e7dfa08250bc9ce51587f01c2b8cd0236a941aed861160

Height

#2,662,120

Difficulty

11.639854

Transactions

5

Size

2.89 KB

Version

2

Bits

0ba3cd71

Nonce

234,695,408

Timestamp

5/15/2018, 1:08:05 PM

Confirmations

4,179,417

Merkle Root

763013ea22150c986da402899fc502143fc3f4799ccf46839aa5ecc27b91fb98
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.822 × 10⁹⁵(96-digit number)
28225149373877074515…11066606690543111681
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.822 × 10⁹⁵(96-digit number)
28225149373877074515…11066606690543111681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.645 × 10⁹⁵(96-digit number)
56450298747754149030…22133213381086223361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.129 × 10⁹⁶(97-digit number)
11290059749550829806…44266426762172446721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.258 × 10⁹⁶(97-digit number)
22580119499101659612…88532853524344893441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.516 × 10⁹⁶(97-digit number)
45160238998203319224…77065707048689786881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.032 × 10⁹⁶(97-digit number)
90320477996406638449…54131414097379573761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.806 × 10⁹⁷(98-digit number)
18064095599281327689…08262828194759147521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.612 × 10⁹⁷(98-digit number)
36128191198562655379…16525656389518295041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.225 × 10⁹⁷(98-digit number)
72256382397125310759…33051312779036590081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.445 × 10⁹⁸(99-digit number)
14451276479425062151…66102625558073180161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.890 × 10⁹⁸(99-digit number)
28902552958850124303…32205251116146360321
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,976,679 XPM·at block #6,841,536 · 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