Block #314,896

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 5:37:24 AM · Difficulty 10.0773 · 6,493,467 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dbc1ed27ad77bad6f9c5421394db6eb0ad07cac51b769c6ab45d907d862d2e5c

Height

#314,896

Difficulty

10.077314

Transactions

11

Size

5.15 KB

Version

2

Bits

0a13cad4

Nonce

105,998

Timestamp

12/16/2013, 5:37:24 AM

Confirmations

6,493,467

Merkle Root

78160b367ec1499dd8c621aa1557b11c296501235c9c15fcad2dbf1c3b9a3df1
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.358 × 10⁹⁷(98-digit number)
13589237996834226943…54523790100812495361
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.358 × 10⁹⁷(98-digit number)
13589237996834226943…54523790100812495361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.717 × 10⁹⁷(98-digit number)
27178475993668453886…09047580201624990721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.435 × 10⁹⁷(98-digit number)
54356951987336907773…18095160403249981441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.087 × 10⁹⁸(99-digit number)
10871390397467381554…36190320806499962881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.174 × 10⁹⁸(99-digit number)
21742780794934763109…72380641612999925761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.348 × 10⁹⁸(99-digit number)
43485561589869526218…44761283225999851521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.697 × 10⁹⁸(99-digit number)
86971123179739052437…89522566451999703041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.739 × 10⁹⁹(100-digit number)
17394224635947810487…79045132903999406081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.478 × 10⁹⁹(100-digit number)
34788449271895620974…58090265807998812161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.957 × 10⁹⁹(100-digit number)
69576898543791241949…16180531615997624321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.391 × 10¹⁰⁰(101-digit number)
13915379708758248389…32361063231995248641
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,710,956 XPM·at block #6,808,362 · 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