Block #2,456,614

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2018, 2:52:23 AM · Difficulty 10.9535 · 4,385,414 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
32187df44f7ea852698198f67b6ddf6fe7ca908a6a26539c20640fd5ed5a21c9

Height

#2,456,614

Difficulty

10.953547

Transactions

55

Size

14.32 KB

Version

2

Bits

0af41bae

Nonce

283,592,324

Timestamp

1/4/2018, 2:52:23 AM

Confirmations

4,385,414

Merkle Root

0b890cdec863b62a4c3a6ff3fefb57ba03df882fc6cf0fbd2aa850c762e29dea
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.

1.457 × 10⁹⁵(96-digit number)
14577294828811740470…31840266573222512001
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
1.457 × 10⁹⁵(96-digit number)
14577294828811740470…31840266573222512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.915 × 10⁹⁵(96-digit number)
29154589657623480940…63680533146445024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.830 × 10⁹⁵(96-digit number)
58309179315246961881…27361066292890048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.166 × 10⁹⁶(97-digit number)
11661835863049392376…54722132585780096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.332 × 10⁹⁶(97-digit number)
23323671726098784752…09444265171560192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.664 × 10⁹⁶(97-digit number)
46647343452197569505…18888530343120384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.329 × 10⁹⁶(97-digit number)
93294686904395139010…37777060686240768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.865 × 10⁹⁷(98-digit number)
18658937380879027802…75554121372481536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.731 × 10⁹⁷(98-digit number)
37317874761758055604…51108242744963072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.463 × 10⁹⁷(98-digit number)
74635749523516111208…02216485489926144001
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,980,610 XPM·at block #6,842,027 · 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