Block #317,152

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2013, 11:56:34 AM · Difficulty 10.1546 · 6,492,569 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
90998227bf55a61ea6c823b401011990817ab12720f7ccb24481992fb7b5d909

Height

#317,152

Difficulty

10.154551

Transactions

16

Size

4.73 KB

Version

2

Bits

0a2790aa

Nonce

180,153

Timestamp

12/17/2013, 11:56:34 AM

Confirmations

6,492,569

Merkle Root

762bf57cb035ae8436c67170197546931c5e5ca2b8cca8e1d610877dbc225261
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.

5.152 × 10¹⁰⁴(105-digit number)
51528768669342390491…76003566935934687361
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
5.152 × 10¹⁰⁴(105-digit number)
51528768669342390491…76003566935934687361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.030 × 10¹⁰⁵(106-digit number)
10305753733868478098…52007133871869374721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.061 × 10¹⁰⁵(106-digit number)
20611507467736956196…04014267743738749441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.122 × 10¹⁰⁵(106-digit number)
41223014935473912393…08028535487477498881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.244 × 10¹⁰⁵(106-digit number)
82446029870947824787…16057070974954997761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.648 × 10¹⁰⁶(107-digit number)
16489205974189564957…32114141949909995521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.297 × 10¹⁰⁶(107-digit number)
32978411948379129914…64228283899819991041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.595 × 10¹⁰⁶(107-digit number)
65956823896758259829…28456567799639982081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.319 × 10¹⁰⁷(108-digit number)
13191364779351651965…56913135599279964161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.638 × 10¹⁰⁷(108-digit number)
26382729558703303931…13826271198559928321
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,849 XPM·at block #6,809,720 · 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