Block #2,457,176

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2018, 11:33:34 AM · Difficulty 10.9539 · 4,381,968 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fc77e3c561848906988bcf1faec47c3f95ac14159e6d64709ff0064de39d2af8

Height

#2,457,176

Difficulty

10.953933

Transactions

2

Size

1.57 KB

Version

2

Bits

0af434fa

Nonce

643,132,749

Timestamp

1/4/2018, 11:33:34 AM

Confirmations

4,381,968

Merkle Root

d1a563681f625dffe21956ac001ee293deef942663a49c87a7dc40a2e05b606d
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.

6.086 × 10⁹⁴(95-digit number)
60861277634872345811…38762330202264491881
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
6.086 × 10⁹⁴(95-digit number)
60861277634872345811…38762330202264491881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.217 × 10⁹⁵(96-digit number)
12172255526974469162…77524660404528983761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.434 × 10⁹⁵(96-digit number)
24344511053948938324…55049320809057967521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.868 × 10⁹⁵(96-digit number)
48689022107897876649…10098641618115935041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.737 × 10⁹⁵(96-digit number)
97378044215795753298…20197283236231870081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.947 × 10⁹⁶(97-digit number)
19475608843159150659…40394566472463740161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.895 × 10⁹⁶(97-digit number)
38951217686318301319…80789132944927480321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.790 × 10⁹⁶(97-digit number)
77902435372636602639…61578265889854960641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.558 × 10⁹⁷(98-digit number)
15580487074527320527…23156531779709921281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.116 × 10⁹⁷(98-digit number)
31160974149054641055…46313063559419842561
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,957,432 XPM·at block #6,839,143 · 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