Block #331,530

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/27/2013, 10:40:43 AM · Difficulty 10.1675 · 6,477,138 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3e9cf00d0e9d406d88f2852ef9b2d236d393967866e5e9f2cc98597f8b49eb2c

Height

#331,530

Difficulty

10.167538

Transactions

27

Size

6.91 KB

Version

2

Bits

0a2ae3c9

Nonce

259,168

Timestamp

12/27/2013, 10:40:43 AM

Confirmations

6,477,138

Merkle Root

02714c900b83f02b5b4634e61a9376611dea3d9bddb7184cd641873912916a5d
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.653 × 10¹⁰¹(102-digit number)
16537583172397733464…70750202964415974401
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.653 × 10¹⁰¹(102-digit number)
16537583172397733464…70750202964415974401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.307 × 10¹⁰¹(102-digit number)
33075166344795466928…41500405928831948801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.615 × 10¹⁰¹(102-digit number)
66150332689590933856…83000811857663897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.323 × 10¹⁰²(103-digit number)
13230066537918186771…66001623715327795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.646 × 10¹⁰²(103-digit number)
26460133075836373542…32003247430655590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.292 × 10¹⁰²(103-digit number)
52920266151672747085…64006494861311180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.058 × 10¹⁰³(104-digit number)
10584053230334549417…28012989722622361601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.116 × 10¹⁰³(104-digit number)
21168106460669098834…56025979445244723201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.233 × 10¹⁰³(104-digit number)
42336212921338197668…12051958890489446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.467 × 10¹⁰³(104-digit number)
84672425842676395336…24103917780978892801
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,713,389 XPM·at block #6,808,667 · 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