Block #2,478,886

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2018, 2:06:57 PM · Difficulty 10.9657 · 4,366,136 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1897bc0d9d66e64cbabdaaa6e03cc950cef169b26d99012d5f1ee42358fcd9a8

Height

#2,478,886

Difficulty

10.965655

Transactions

23

Size

7.58 KB

Version

2

Bits

0af73529

Nonce

998,268,996

Timestamp

1/18/2018, 2:06:57 PM

Confirmations

4,366,136

Merkle Root

98ada3e8fce68e2c0350dff57987afcf59aabb52cbf6f0e6c9e1a0eff83859b1
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.

1.812 × 10⁹⁷(98-digit number)
18123021331226030925…35446410166499287041
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
1.812 × 10⁹⁷(98-digit number)
18123021331226030925…35446410166499287041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.624 × 10⁹⁷(98-digit number)
36246042662452061851…70892820332998574081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.249 × 10⁹⁷(98-digit number)
72492085324904123703…41785640665997148161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.449 × 10⁹⁸(99-digit number)
14498417064980824740…83571281331994296321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.899 × 10⁹⁸(99-digit number)
28996834129961649481…67142562663988592641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.799 × 10⁹⁸(99-digit number)
57993668259923298963…34285125327977185281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.159 × 10⁹⁹(100-digit number)
11598733651984659792…68570250655954370561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.319 × 10⁹⁹(100-digit number)
23197467303969319585…37140501311908741121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.639 × 10⁹⁹(100-digit number)
46394934607938639170…74281002623817482241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.278 × 10⁹⁹(100-digit number)
92789869215877278341…48562005247634964481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.855 × 10¹⁰⁰(101-digit number)
18557973843175455668…97124010495269928961
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,004,600 XPM·at block #6,845,021 · 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