Block #2,667,898

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/19/2018, 5:17:23 AM · Difficulty 11.6733 · 4,163,562 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5ac215c8c5410aa27a1fd061ee2560350326040d5236b29873ada937daf64f87

Height

#2,667,898

Difficulty

11.673342

Transactions

3

Size

915 B

Version

2

Bits

0bac6021

Nonce

155,018,606

Timestamp

5/19/2018, 5:17:23 AM

Confirmations

4,163,562

Merkle Root

822013b06648b9177d10e10aa1e390a0f362c53172fd09910578e3ed587bfa64
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.777 × 10⁹⁵(96-digit number)
27779101901561461618…14233292227604175521
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.777 × 10⁹⁵(96-digit number)
27779101901561461618…14233292227604175521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.555 × 10⁹⁵(96-digit number)
55558203803122923237…28466584455208351041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.111 × 10⁹⁶(97-digit number)
11111640760624584647…56933168910416702081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.222 × 10⁹⁶(97-digit number)
22223281521249169294…13866337820833404161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.444 × 10⁹⁶(97-digit number)
44446563042498338589…27732675641666808321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.889 × 10⁹⁶(97-digit number)
88893126084996677179…55465351283333616641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.777 × 10⁹⁷(98-digit number)
17778625216999335435…10930702566667233281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.555 × 10⁹⁷(98-digit number)
35557250433998670871…21861405133334466561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.111 × 10⁹⁷(98-digit number)
71114500867997341743…43722810266668933121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.422 × 10⁹⁸(99-digit number)
14222900173599468348…87445620533337866241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.844 × 10⁹⁸(99-digit number)
28445800347198936697…74891241066675732481
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,895,771 XPM·at block #6,831,459 · 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