Block #316,706

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2013, 5:43:27 AM · Difficulty 10.1422 · 6,492,983 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
616242b06834eccc92309ab9e7ac35038ce58643e43e7e254fc5118a87309753

Height

#316,706

Difficulty

10.142174

Transactions

32

Size

15.18 KB

Version

2

Bits

0a246585

Nonce

16,619

Timestamp

12/17/2013, 5:43:27 AM

Confirmations

6,492,983

Merkle Root

7bddfc1fa81b12b4bf90c1c7ddc37d5ff77c46644e95691a6e7891a583ffa7f3
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.468 × 10⁹⁶(97-digit number)
14686466694469208979…16947075498057344321
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.468 × 10⁹⁶(97-digit number)
14686466694469208979…16947075498057344321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.937 × 10⁹⁶(97-digit number)
29372933388938417959…33894150996114688641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.874 × 10⁹⁶(97-digit number)
58745866777876835919…67788301992229377281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.174 × 10⁹⁷(98-digit number)
11749173355575367183…35576603984458754561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.349 × 10⁹⁷(98-digit number)
23498346711150734367…71153207968917509121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.699 × 10⁹⁷(98-digit number)
46996693422301468735…42306415937835018241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.399 × 10⁹⁷(98-digit number)
93993386844602937471…84612831875670036481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.879 × 10⁹⁸(99-digit number)
18798677368920587494…69225663751340072961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.759 × 10⁹⁸(99-digit number)
37597354737841174988…38451327502680145921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.519 × 10⁹⁸(99-digit number)
75194709475682349977…76902655005360291841
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,721,588 XPM·at block #6,809,688 · 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.

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