Block #2,642,996

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 10:47:49 PM · Difficulty 11.6702 · 4,187,633 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c318def532e37d14d11caee0492616dd7a64226a4027786383d174846e823e98

Height

#2,642,996

Difficulty

11.670203

Transactions

11

Size

3.64 KB

Version

2

Bits

0bab9265

Nonce

951,652,403

Timestamp

5/1/2018, 10:47:49 PM

Confirmations

4,187,633

Merkle Root

99d63f259eb6cc4bd7a39b002c1826552397dc92d192a3cee629002234fe6265
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.

6.284 × 10⁹⁴(95-digit number)
62845962831487678225…08769028934049680001
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
6.284 × 10⁹⁴(95-digit number)
62845962831487678225…08769028934049680001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.256 × 10⁹⁵(96-digit number)
12569192566297535645…17538057868099360001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.513 × 10⁹⁵(96-digit number)
25138385132595071290…35076115736198720001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.027 × 10⁹⁵(96-digit number)
50276770265190142580…70152231472397440001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.005 × 10⁹⁶(97-digit number)
10055354053038028516…40304462944794880001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.011 × 10⁹⁶(97-digit number)
20110708106076057032…80608925889589760001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.022 × 10⁹⁶(97-digit number)
40221416212152114064…61217851779179520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.044 × 10⁹⁶(97-digit number)
80442832424304228128…22435703558359040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.608 × 10⁹⁷(98-digit number)
16088566484860845625…44871407116718080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.217 × 10⁹⁷(98-digit number)
32177132969721691251…89742814233436160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.435 × 10⁹⁷(98-digit number)
64354265939443382502…79485628466872320001
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,889,154 XPM·at block #6,830,628 · 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