Block #318,960

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2013, 5:20:56 PM · Difficulty 10.1628 · 6,489,345 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0c8a53381c69c20873fad4576e02b4de87321c1e3cba8fd495b550d7eaea1af3

Height

#318,960

Difficulty

10.162781

Transactions

13

Size

3.50 KB

Version

2

Bits

0a29ac06

Nonce

48,279

Timestamp

12/18/2013, 5:20:56 PM

Confirmations

6,489,345

Merkle Root

15501d770e9f5bc2911be47cba76828b966deecff13fa3b782aadce90fddee16
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.135 × 10⁹⁸(99-digit number)
11350166360946911312…62846040248006474241
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.135 × 10⁹⁸(99-digit number)
11350166360946911312…62846040248006474241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.270 × 10⁹⁸(99-digit number)
22700332721893822624…25692080496012948481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.540 × 10⁹⁸(99-digit number)
45400665443787645248…51384160992025896961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.080 × 10⁹⁸(99-digit number)
90801330887575290496…02768321984051793921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.816 × 10⁹⁹(100-digit number)
18160266177515058099…05536643968103587841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.632 × 10⁹⁹(100-digit number)
36320532355030116198…11073287936207175681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.264 × 10⁹⁹(100-digit number)
72641064710060232397…22146575872414351361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.452 × 10¹⁰⁰(101-digit number)
14528212942012046479…44293151744828702721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.905 × 10¹⁰⁰(101-digit number)
29056425884024092958…88586303489657405441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.811 × 10¹⁰⁰(101-digit number)
58112851768048185917…77172606979314810881
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,710,494 XPM·at block #6,808,304 · 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