Block #2,820,883

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/2/2018, 5:06:07 AM · Difficulty 11.7003 · 4,012,923 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9d5e6206c55f40112473fe3e1224e1f916ca74855665306c01f338f7e8134269

Height

#2,820,883

Difficulty

11.700283

Transactions

21

Size

5.63 KB

Version

2

Bits

0bb345ba

Nonce

395,830,831

Timestamp

9/2/2018, 5:06:07 AM

Confirmations

4,012,923

Merkle Root

6e0ebf4388c822650656558768c89322ab8a56cd78b0f0b0bade65e9f0009bfa
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.

4.535 × 10⁹⁴(95-digit number)
45358313804408273206…16209818307085840241
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
4.535 × 10⁹⁴(95-digit number)
45358313804408273206…16209818307085840241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.071 × 10⁹⁴(95-digit number)
90716627608816546413…32419636614171680481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.814 × 10⁹⁵(96-digit number)
18143325521763309282…64839273228343360961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.628 × 10⁹⁵(96-digit number)
36286651043526618565…29678546456686721921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.257 × 10⁹⁵(96-digit number)
72573302087053237130…59357092913373443841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.451 × 10⁹⁶(97-digit number)
14514660417410647426…18714185826746887681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.902 × 10⁹⁶(97-digit number)
29029320834821294852…37428371653493775361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.805 × 10⁹⁶(97-digit number)
58058641669642589704…74856743306987550721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.161 × 10⁹⁷(98-digit number)
11611728333928517940…49713486613975101441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.322 × 10⁹⁷(98-digit number)
23223456667857035881…99426973227950202881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.644 × 10⁹⁷(98-digit number)
46446913335714071763…98853946455900405761
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,914,671 XPM·at block #6,833,805 · 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