Block #2,177,886

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/25/2017, 7:34:00 PM · Difficulty 10.9244 · 4,652,597 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
15fe6121c8670247bfa8aa595639e3b47f626376b8071a469e6f4d97e7bdc63f

Height

#2,177,886

Difficulty

10.924385

Transactions

25

Size

6.01 KB

Version

2

Bits

0aeca483

Nonce

1,830,788,882

Timestamp

6/25/2017, 7:34:00 PM

Confirmations

4,652,597

Merkle Root

ddb405c705a20358f7a813c9f80831e613834f08306881c4367ecf86de4988db
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.046 × 10⁹⁵(96-digit number)
20468456769146875948…11132504209749758081
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.046 × 10⁹⁵(96-digit number)
20468456769146875948…11132504209749758081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.093 × 10⁹⁵(96-digit number)
40936913538293751897…22265008419499516161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.187 × 10⁹⁵(96-digit number)
81873827076587503795…44530016838999032321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.637 × 10⁹⁶(97-digit number)
16374765415317500759…89060033677998064641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.274 × 10⁹⁶(97-digit number)
32749530830635001518…78120067355996129281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.549 × 10⁹⁶(97-digit number)
65499061661270003036…56240134711992258561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.309 × 10⁹⁷(98-digit number)
13099812332254000607…12480269423984517121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.619 × 10⁹⁷(98-digit number)
26199624664508001214…24960538847969034241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.239 × 10⁹⁷(98-digit number)
52399249329016002429…49921077695938068481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.047 × 10⁹⁸(99-digit number)
10479849865803200485…99842155391876136961
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,888,112 XPM·at block #6,830,482 · 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