Block #2,697,818

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/9/2018, 5:38:12 AM · Difficulty 11.6516 · 4,135,897 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
12e2334af19cc2669f0af763390892096232d8d4dee4682287d317730abbcb8d

Height

#2,697,818

Difficulty

11.651595

Transactions

7

Size

2.11 KB

Version

2

Bits

0ba6cee6

Nonce

36,129,059

Timestamp

6/9/2018, 5:38:12 AM

Confirmations

4,135,897

Merkle Root

69da339d97fde5013d0610cc22d5ab572f45abbfb7ddab6cd5b3feeacf9e2444
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.

5.418 × 10⁹²(93-digit number)
54187100899444348724…36719501128998512401
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
5.418 × 10⁹²(93-digit number)
54187100899444348724…36719501128998512401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.083 × 10⁹³(94-digit number)
10837420179888869744…73439002257997024801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.167 × 10⁹³(94-digit number)
21674840359777739489…46878004515994049601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.334 × 10⁹³(94-digit number)
43349680719555478979…93756009031988099201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.669 × 10⁹³(94-digit number)
86699361439110957959…87512018063976198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.733 × 10⁹⁴(95-digit number)
17339872287822191591…75024036127952396801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.467 × 10⁹⁴(95-digit number)
34679744575644383183…50048072255904793601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.935 × 10⁹⁴(95-digit number)
69359489151288766367…00096144511809587201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.387 × 10⁹⁵(96-digit number)
13871897830257753273…00192289023619174401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.774 × 10⁹⁵(96-digit number)
27743795660515506547…00384578047238348801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.548 × 10⁹⁵(96-digit number)
55487591321031013094…00769156094476697601
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,913,942 XPM·at block #6,833,714 · 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