Block #2,877,036

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/11/2018, 6:31:22 PM · Difficulty 11.6504 · 3,968,208 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5703f3aae085b0e9b1190d876f26bba67bd7b16f0e7fbed7357f03f7817bb96e

Height

#2,877,036

Difficulty

11.650377

Transactions

14

Size

6.95 KB

Version

2

Bits

0ba67f18

Nonce

128,537,460

Timestamp

10/11/2018, 6:31:22 PM

Confirmations

3,968,208

Merkle Root

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

5.010 × 10⁹⁶(97-digit number)
50102551851779856798…35814186665080517121
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
5.010 × 10⁹⁶(97-digit number)
50102551851779856798…35814186665080517121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.002 × 10⁹⁷(98-digit number)
10020510370355971359…71628373330161034241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.004 × 10⁹⁷(98-digit number)
20041020740711942719…43256746660322068481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.008 × 10⁹⁷(98-digit number)
40082041481423885438…86513493320644136961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.016 × 10⁹⁷(98-digit number)
80164082962847770877…73026986641288273921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.603 × 10⁹⁸(99-digit number)
16032816592569554175…46053973282576547841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.206 × 10⁹⁸(99-digit number)
32065633185139108351…92107946565153095681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.413 × 10⁹⁸(99-digit number)
64131266370278216702…84215893130306191361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.282 × 10⁹⁹(100-digit number)
12826253274055643340…68431786260612382721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.565 × 10⁹⁹(100-digit number)
25652506548111286680…36863572521224765441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.130 × 10⁹⁹(100-digit number)
51305013096222573361…73727145042449530881
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:58,006,385 XPM·at block #6,845,243 · 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