Block #318,698

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2013, 1:12:18 PM · Difficulty 10.1612 · 6,489,292 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cca1861a4c3b6150eed5818bcd20524e2f5116eb05d7ab49087b17e102cad147

Height

#318,698

Difficulty

10.161166

Transactions

6

Size

2.15 KB

Version

2

Bits

0a294234

Nonce

159,128

Timestamp

12/18/2013, 1:12:18 PM

Confirmations

6,489,292

Merkle Root

ffad035bb7a6e310a04c60d34458c559bfeed5d37137cd2f7d2a5a7fcf9754bb
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.046 × 10¹⁰²(103-digit number)
10466143298162938559…59444823080855424001
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.046 × 10¹⁰²(103-digit number)
10466143298162938559…59444823080855424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.093 × 10¹⁰²(103-digit number)
20932286596325877119…18889646161710848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.186 × 10¹⁰²(103-digit number)
41864573192651754238…37779292323421696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.372 × 10¹⁰²(103-digit number)
83729146385303508476…75558584646843392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.674 × 10¹⁰³(104-digit number)
16745829277060701695…51117169293686784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.349 × 10¹⁰³(104-digit number)
33491658554121403390…02234338587373568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.698 × 10¹⁰³(104-digit number)
66983317108242806780…04468677174747136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.339 × 10¹⁰⁴(105-digit number)
13396663421648561356…08937354349494272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.679 × 10¹⁰⁴(105-digit number)
26793326843297122712…17874708698988544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.358 × 10¹⁰⁴(105-digit number)
53586653686594245424…35749417397977088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.071 × 10¹⁰⁵(106-digit number)
10717330737318849084…71498834795954176001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,707,958 XPM·at block #6,807,989 · 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