Block #2,817,973

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/31/2018, 5:35:25 AM · Difficulty 11.6966 · 4,012,815 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
db28b4d9ec2c1d88487cbbc443819c98d9616ecb3e3f3e437e4e3ab4fe6cf8e3

Height

#2,817,973

Difficulty

11.696617

Transactions

6

Size

4.29 KB

Version

2

Bits

0bb25579

Nonce

58,810,307

Timestamp

8/31/2018, 5:35:25 AM

Confirmations

4,012,815

Merkle Root

61a062077f2218fdcbd0c378df9d97a74e624eadcee89cc1d21c0d02abf5098a
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.848 × 10⁹⁵(96-digit number)
28487434988606583719…90563842816437237761
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.848 × 10⁹⁵(96-digit number)
28487434988606583719…90563842816437237761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.697 × 10⁹⁵(96-digit number)
56974869977213167439…81127685632874475521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.139 × 10⁹⁶(97-digit number)
11394973995442633487…62255371265748951041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.278 × 10⁹⁶(97-digit number)
22789947990885266975…24510742531497902081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.557 × 10⁹⁶(97-digit number)
45579895981770533951…49021485062995804161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.115 × 10⁹⁶(97-digit number)
91159791963541067902…98042970125991608321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.823 × 10⁹⁷(98-digit number)
18231958392708213580…96085940251983216641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.646 × 10⁹⁷(98-digit number)
36463916785416427161…92171880503966433281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.292 × 10⁹⁷(98-digit number)
72927833570832854322…84343761007932866561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.458 × 10⁹⁸(99-digit number)
14585566714166570864…68687522015865733121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.917 × 10⁹⁸(99-digit number)
29171133428333141728…37375044031731466241
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,890,441 XPM·at block #6,830,787 · 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