Block #2,176,995

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/25/2017, 7:52:33 AM · Difficulty 10.9214 · 4,667,489 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d2203492af3f3266a3b54a3587765a5e52c4b6541e156b6e4e2c930828fd7e81

Height

#2,176,995

Difficulty

10.921441

Transactions

2

Size

1.30 KB

Version

2

Bits

0aebe388

Nonce

1,041,154,645

Timestamp

6/25/2017, 7:52:33 AM

Confirmations

4,667,489

Merkle Root

754ef9afa9126044b4ed2493ccbd13420e2c0928b0d2731ad4720275828fe288
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.

8.502 × 10⁹³(94-digit number)
85022194821592241208…89547714014669920549
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
8.502 × 10⁹³(94-digit number)
85022194821592241208…89547714014669920549
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.700 × 10⁹⁴(95-digit number)
17004438964318448241…79095428029339841099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.400 × 10⁹⁴(95-digit number)
34008877928636896483…58190856058679682199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.801 × 10⁹⁴(95-digit number)
68017755857273792966…16381712117359364399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.360 × 10⁹⁵(96-digit number)
13603551171454758593…32763424234718728799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.720 × 10⁹⁵(96-digit number)
27207102342909517186…65526848469437457599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.441 × 10⁹⁵(96-digit number)
54414204685819034373…31053696938874915199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.088 × 10⁹⁶(97-digit number)
10882840937163806874…62107393877749830399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.176 × 10⁹⁶(97-digit number)
21765681874327613749…24214787755499660799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.353 × 10⁹⁶(97-digit number)
43531363748655227498…48429575510999321599
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:58,000,268 XPM·at block #6,844,483 · 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