Block #320,493

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2013, 4:47:39 PM · Difficulty 10.1837 · 6,489,612 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bd0536857122e19f397a8679296e7a9aadb8f92352e9e992cf136981ae6392a8

Height

#320,493

Difficulty

10.183721

Transactions

36

Size

12.76 KB

Version

2

Bits

0a2f085a

Nonce

485,732

Timestamp

12/19/2013, 4:47:39 PM

Confirmations

6,489,612

Merkle Root

0690d7963b7f04a6e222b085ef6923fc753828a5f498943ba434bb66070e52f7
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.

2.893 × 10¹⁰⁰(101-digit number)
28932659101094217561…53621601170028979201
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
2.893 × 10¹⁰⁰(101-digit number)
28932659101094217561…53621601170028979201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.786 × 10¹⁰⁰(101-digit number)
57865318202188435123…07243202340057958401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.157 × 10¹⁰¹(102-digit number)
11573063640437687024…14486404680115916801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.314 × 10¹⁰¹(102-digit number)
23146127280875374049…28972809360231833601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.629 × 10¹⁰¹(102-digit number)
46292254561750748098…57945618720463667201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.258 × 10¹⁰¹(102-digit number)
92584509123501496197…15891237440927334401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.851 × 10¹⁰²(103-digit number)
18516901824700299239…31782474881854668801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.703 × 10¹⁰²(103-digit number)
37033803649400598479…63564949763709337601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.406 × 10¹⁰²(103-digit number)
74067607298801196958…27129899527418675201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.481 × 10¹⁰³(104-digit number)
14813521459760239391…54259799054837350401
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,724,910 XPM·at block #6,810,104 · 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