Block #1,458,318

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/15/2016, 3:56:15 PM · Difficulty 10.7637 · 5,381,971 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8ea416e8b59e96044d6f47ee22785dab6f3a6aa7a3c0263778ede07151929756

Height

#1,458,318

Difficulty

10.763657

Transactions

2

Size

10.97 KB

Version

2

Bits

0ac37f08

Nonce

13,539,729

Timestamp

2/15/2016, 3:56:15 PM

Confirmations

5,381,971

Merkle Root

10600c31d4225f5efe56bb410917b633f57db29e8302b427b049bb0cd9d9431b
Transactions (2)
1 in → 1 out8.7400 XPM110 B
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.

7.452 × 10⁹⁶(97-digit number)
74520954969179818528…00004123420340715521
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
7.452 × 10⁹⁶(97-digit number)
74520954969179818528…00004123420340715521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.490 × 10⁹⁷(98-digit number)
14904190993835963705…00008246840681431041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.980 × 10⁹⁷(98-digit number)
29808381987671927411…00016493681362862081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.961 × 10⁹⁷(98-digit number)
59616763975343854822…00032987362725724161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.192 × 10⁹⁸(99-digit number)
11923352795068770964…00065974725451448321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.384 × 10⁹⁸(99-digit number)
23846705590137541929…00131949450902896641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.769 × 10⁹⁸(99-digit number)
47693411180275083858…00263898901805793281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.538 × 10⁹⁸(99-digit number)
95386822360550167716…00527797803611586561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.907 × 10⁹⁹(100-digit number)
19077364472110033543…01055595607223173121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.815 × 10⁹⁹(100-digit number)
38154728944220067086…02111191214446346241
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,966,629 XPM·at block #6,840,288 · 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