Block #2,701,996

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/12/2018, 8:44:50 AM · Difficulty 11.6282 · 4,140,317 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
81dfd624253c0f42491b16e9300d95d92e8d0c62c7e210bb5440235fccef94c9

Height

#2,701,996

Difficulty

11.628175

Transactions

7

Size

2.09 KB

Version

2

Bits

0ba0d01b

Nonce

14,952,623

Timestamp

6/12/2018, 8:44:50 AM

Confirmations

4,140,317

Merkle Root

e91cc01225938aa32c632a9aa5cdadc612c90e85a19657443a6149c48b1f2fad
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.

1.517 × 10⁹⁶(97-digit number)
15176120731558682742…50991705273040679761
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
1.517 × 10⁹⁶(97-digit number)
15176120731558682742…50991705273040679761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.035 × 10⁹⁶(97-digit number)
30352241463117365485…01983410546081359521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.070 × 10⁹⁶(97-digit number)
60704482926234730970…03966821092162719041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.214 × 10⁹⁷(98-digit number)
12140896585246946194…07933642184325438081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.428 × 10⁹⁷(98-digit number)
24281793170493892388…15867284368650876161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.856 × 10⁹⁷(98-digit number)
48563586340987784776…31734568737301752321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.712 × 10⁹⁷(98-digit number)
97127172681975569552…63469137474603504641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.942 × 10⁹⁸(99-digit number)
19425434536395113910…26938274949207009281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.885 × 10⁹⁸(99-digit number)
38850869072790227820…53876549898414018561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.770 × 10⁹⁸(99-digit number)
77701738145580455641…07753099796828037121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.554 × 10⁹⁹(100-digit number)
15540347629116091128…15506199593656074241
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,982,911 XPM·at block #6,842,312 · 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