Block #2,415,919

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2017, 8:01:57 AM · Difficulty 10.9041 · 4,425,133 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
be581e5b285395fb0baeed5e61e7a99db7d7fc7ae89cf4eccc16f4ec9fedaa49

Height

#2,415,919

Difficulty

10.904120

Transactions

7

Size

2.08 KB

Version

2

Bits

0ae7746e

Nonce

972,953,609

Timestamp

12/9/2017, 8:01:57 AM

Confirmations

4,425,133

Merkle Root

e75615603e50f38b1517bfc5d2aa6b87c0c654219f943cac16cd748927445c3f
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.041 × 10⁹⁴(95-digit number)
20416657483350250223…68462926052058704881
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.041 × 10⁹⁴(95-digit number)
20416657483350250223…68462926052058704881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.083 × 10⁹⁴(95-digit number)
40833314966700500446…36925852104117409761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.166 × 10⁹⁴(95-digit number)
81666629933401000893…73851704208234819521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.633 × 10⁹⁵(96-digit number)
16333325986680200178…47703408416469639041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.266 × 10⁹⁵(96-digit number)
32666651973360400357…95406816832939278081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.533 × 10⁹⁵(96-digit number)
65333303946720800714…90813633665878556161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.306 × 10⁹⁶(97-digit number)
13066660789344160142…81627267331757112321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.613 × 10⁹⁶(97-digit number)
26133321578688320285…63254534663514224641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.226 × 10⁹⁶(97-digit number)
52266643157376640571…26509069327028449281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.045 × 10⁹⁷(98-digit number)
10453328631475328114…53018138654056898561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.090 × 10⁹⁷(98-digit number)
20906657262950656228…06036277308113797121
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,972,779 XPM·at block #6,841,051 · 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