Block #2,540,815

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/27/2018, 11:37:41 AM · Difficulty 10.9871 · 4,270,331 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2be6cd3c6ff0db72b8ab64e880a2682ef3773bf479707e4aaa7bc96db8a43171

Height

#2,540,815

Difficulty

10.987120

Transactions

6

Size

8.67 KB

Version

2

Bits

0afcb3e0

Nonce

457,418,877

Timestamp

2/27/2018, 11:37:41 AM

Confirmations

4,270,331

Merkle Root

8f5b4f0389e10ca38a80bfbec5d916a5a2365ebd6ea6893b5ca44caf16468544
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.

4.248 × 10⁹⁵(96-digit number)
42486928893772823451…09650077304758156801
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
4.248 × 10⁹⁵(96-digit number)
42486928893772823451…09650077304758156801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.497 × 10⁹⁵(96-digit number)
84973857787545646903…19300154609516313601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.699 × 10⁹⁶(97-digit number)
16994771557509129380…38600309219032627201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.398 × 10⁹⁶(97-digit number)
33989543115018258761…77200618438065254401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.797 × 10⁹⁶(97-digit number)
67979086230036517523…54401236876130508801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.359 × 10⁹⁷(98-digit number)
13595817246007303504…08802473752261017601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.719 × 10⁹⁷(98-digit number)
27191634492014607009…17604947504522035201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.438 × 10⁹⁷(98-digit number)
54383268984029214018…35209895009044070401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.087 × 10⁹⁸(99-digit number)
10876653796805842803…70419790018088140801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.175 × 10⁹⁸(99-digit number)
21753307593611685607…40839580036176281601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.350 × 10⁹⁸(99-digit number)
43506615187223371214…81679160072352563201
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,733,278 XPM·at block #6,811,145 · 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.

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