Block #2,180,358

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/27/2017, 4:08:35 AM · Difficulty 10.9318 · 4,644,206 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1d15d632c528bb65cd87d469c7cfaa19b25e0a04d5e696e782966baa9f53b4f2

Height

#2,180,358

Difficulty

10.931822

Transactions

2

Size

427 B

Version

2

Bits

0aee8bde

Nonce

647,366,472

Timestamp

6/27/2017, 4:08:35 AM

Confirmations

4,644,206

Merkle Root

3ac59cfb2ab94d14f08f76b867e39e0098c05c8f1944b6905a1c37daceca93b1
Transactions (2)
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.338 × 10⁹⁶(97-digit number)
53388321023090912055…20700913760933498881
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.338 × 10⁹⁶(97-digit number)
53388321023090912055…20700913760933498881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.067 × 10⁹⁷(98-digit number)
10677664204618182411…41401827521866997761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.135 × 10⁹⁷(98-digit number)
21355328409236364822…82803655043733995521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.271 × 10⁹⁷(98-digit number)
42710656818472729644…65607310087467991041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.542 × 10⁹⁷(98-digit number)
85421313636945459288…31214620174935982081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.708 × 10⁹⁸(99-digit number)
17084262727389091857…62429240349871964161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.416 × 10⁹⁸(99-digit number)
34168525454778183715…24858480699743928321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.833 × 10⁹⁸(99-digit number)
68337050909556367430…49716961399487856641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.366 × 10⁹⁹(100-digit number)
13667410181911273486…99433922798975713281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.733 × 10⁹⁹(100-digit number)
27334820363822546972…98867845597951426561
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,840,577 XPM·at block #6,824,563 · 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