Block #316,752

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2013, 6:13:53 AM · Difficulty 10.1439 · 6,508,135 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9e1f6e22c0ff8c6ccffb2870edd1e6c28442838d704710bbcca6c54187e81426

Height

#316,752

Difficulty

10.143950

Transactions

1

Size

1.08 KB

Version

2

Bits

0a24d9e6

Nonce

28,639

Timestamp

12/17/2013, 6:13:53 AM

Confirmations

6,508,135

Merkle Root

87bdd96bb979a19606f532d61ff3d7d3084bb6ce1e3ebaace6b06e775f768085
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.

3.706 × 10⁹⁵(96-digit number)
37068428419467865837…99296447345527544001
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
3.706 × 10⁹⁵(96-digit number)
37068428419467865837…99296447345527544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.413 × 10⁹⁵(96-digit number)
74136856838935731675…98592894691055088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.482 × 10⁹⁶(97-digit number)
14827371367787146335…97185789382110176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.965 × 10⁹⁶(97-digit number)
29654742735574292670…94371578764220352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.930 × 10⁹⁶(97-digit number)
59309485471148585340…88743157528440704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.186 × 10⁹⁷(98-digit number)
11861897094229717068…77486315056881408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.372 × 10⁹⁷(98-digit number)
23723794188459434136…54972630113762816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.744 × 10⁹⁷(98-digit number)
47447588376918868272…09945260227525632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.489 × 10⁹⁷(98-digit number)
94895176753837736544…19890520455051264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.897 × 10⁹⁸(99-digit number)
18979035350767547308…39781040910102528001
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,843,177 XPM·at block #6,824,886 · 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