Block #2,815,565

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/29/2018, 4:48:34 PM · Difficulty 11.6843 · 4,028,480 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fa995c50000783317f8d3bf7c4e9230a95240e8955e3fa74b2f7c33c92297b33

Height

#2,815,565

Difficulty

11.684276

Transactions

4

Size

991 B

Version

2

Bits

0baf2cb8

Nonce

320,020,017

Timestamp

8/29/2018, 4:48:34 PM

Confirmations

4,028,480

Merkle Root

48176b273053e42b3570d627211caf356abd8b6733da2e15b62f77c63d94e475
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.

3.825 × 10⁹⁵(96-digit number)
38250747518209318684…70237511147407719041
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
3.825 × 10⁹⁵(96-digit number)
38250747518209318684…70237511147407719041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.650 × 10⁹⁵(96-digit number)
76501495036418637368…40475022294815438081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.530 × 10⁹⁶(97-digit number)
15300299007283727473…80950044589630876161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.060 × 10⁹⁶(97-digit number)
30600598014567454947…61900089179261752321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.120 × 10⁹⁶(97-digit number)
61201196029134909894…23800178358523504641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.224 × 10⁹⁷(98-digit number)
12240239205826981978…47600356717047009281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.448 × 10⁹⁷(98-digit number)
24480478411653963957…95200713434094018561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.896 × 10⁹⁷(98-digit number)
48960956823307927915…90401426868188037121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.792 × 10⁹⁷(98-digit number)
97921913646615855831…80802853736376074241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.958 × 10⁹⁸(99-digit number)
19584382729323171166…61605707472752148481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.916 × 10⁹⁸(99-digit number)
39168765458646342332…23211414945504296961
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,996,730 XPM·at block #6,844,044 · 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