Block #2,173,709

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/23/2017, 12:37:52 PM · Difficulty 10.9098 · 4,664,617 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee3873b72872b851f29f0d89c8bae2d19e87bbebb0eaa36838ab6ef18c4a70b0

Height

#2,173,709

Difficulty

10.909805

Transactions

2

Size

723 B

Version

2

Bits

0ae8e8f8

Nonce

173,475,170

Timestamp

6/23/2017, 12:37:52 PM

Confirmations

4,664,617

Merkle Root

b1ec49298413b3849a62827d602721b878fc12f0e9ea52df808aaffb90578188
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.073 × 10⁹⁴(95-digit number)
50731690526951857079…16793726550508926399
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.073 × 10⁹⁴(95-digit number)
50731690526951857079…16793726550508926399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.014 × 10⁹⁵(96-digit number)
10146338105390371415…33587453101017852799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.029 × 10⁹⁵(96-digit number)
20292676210780742831…67174906202035705599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.058 × 10⁹⁵(96-digit number)
40585352421561485663…34349812404071411199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.117 × 10⁹⁵(96-digit number)
81170704843122971327…68699624808142822399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.623 × 10⁹⁶(97-digit number)
16234140968624594265…37399249616285644799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.246 × 10⁹⁶(97-digit number)
32468281937249188531…74798499232571289599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.493 × 10⁹⁶(97-digit number)
64936563874498377062…49596998465142579199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.298 × 10⁹⁷(98-digit number)
12987312774899675412…99193996930285158399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.597 × 10⁹⁷(98-digit number)
25974625549799350824…98387993860570316799
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:57,950,883 XPM·at block #6,838,325 · 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