Block #2,930,272

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/19/2018, 5:05:20 PM · Difficulty 11.3885 · 3,906,358 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fcc22819ccc41ae607a45ae2cdbad22974f492b54e5b12224655e8368a38e252

Height

#2,930,272

Difficulty

11.388518

Transactions

7

Size

2.33 KB

Version

2

Bits

0b6375e4

Nonce

789,265,396

Timestamp

11/19/2018, 5:05:20 PM

Confirmations

3,906,358

Merkle Root

a28f0c05569ea38f32e234e78853ec7692505fe2d87bc99ab8b01e64c59e8762
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.822 × 10⁹⁴(95-digit number)
28225260447791438398…74470831717525378561
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.822 × 10⁹⁴(95-digit number)
28225260447791438398…74470831717525378561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.645 × 10⁹⁴(95-digit number)
56450520895582876797…48941663435050757121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.129 × 10⁹⁵(96-digit number)
11290104179116575359…97883326870101514241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.258 × 10⁹⁵(96-digit number)
22580208358233150719…95766653740203028481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.516 × 10⁹⁵(96-digit number)
45160416716466301438…91533307480406056961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.032 × 10⁹⁵(96-digit number)
90320833432932602876…83066614960812113921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.806 × 10⁹⁶(97-digit number)
18064166686586520575…66133229921624227841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.612 × 10⁹⁶(97-digit number)
36128333373173041150…32266459843248455681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.225 × 10⁹⁶(97-digit number)
72256666746346082301…64532919686496911361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.445 × 10⁹⁷(98-digit number)
14451333349269216460…29065839372993822721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.890 × 10⁹⁷(98-digit number)
28902666698538432920…58131678745987645441
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,937,312 XPM·at block #6,836,629 · 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