Block #2,181,150

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/27/2017, 1:51:57 PM · Difficulty 10.9346 · 4,660,387 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2b19c160fbdd8b529aa4473a79f952e8ee409773886061108646e974bdabddcd

Height

#2,181,150

Difficulty

10.934605

Transactions

8

Size

3.67 KB

Version

2

Bits

0aef4243

Nonce

701,595,841

Timestamp

6/27/2017, 1:51:57 PM

Confirmations

4,660,387

Merkle Root

03f11ff3a4a52d6db3724142c335ebff1414e092a4722c4908f01f9251ec1e6c
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.064 × 10⁹³(94-digit number)
10645909992307533288…28539655803740049601
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.064 × 10⁹³(94-digit number)
10645909992307533288…28539655803740049601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.129 × 10⁹³(94-digit number)
21291819984615066577…57079311607480099201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.258 × 10⁹³(94-digit number)
42583639969230133155…14158623214960198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.516 × 10⁹³(94-digit number)
85167279938460266310…28317246429920396801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.703 × 10⁹⁴(95-digit number)
17033455987692053262…56634492859840793601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.406 × 10⁹⁴(95-digit number)
34066911975384106524…13268985719681587201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.813 × 10⁹⁴(95-digit number)
68133823950768213048…26537971439363174401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.362 × 10⁹⁵(96-digit number)
13626764790153642609…53075942878726348801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.725 × 10⁹⁵(96-digit number)
27253529580307285219…06151885757452697601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.450 × 10⁹⁵(96-digit number)
54507059160614570438…12303771514905395201
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,976,679 XPM·at block #6,841,536 · 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