Block #289,349

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/2/2013, 4:10:00 AM · Difficulty 9.9885 · 6,526,623 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
34e8a7a511e4368a8266c25da70d31418a793dd8f4c49ef2b6917c2b77cb61ee

Height

#289,349

Difficulty

9.988454

Transactions

5

Size

1.78 KB

Version

2

Bits

09fd0b4a

Nonce

25,439

Timestamp

12/2/2013, 4:10:00 AM

Confirmations

6,526,623

Merkle Root

8be8723405ce9cfa7e82598cfef883ca0d44b795ef4f5aaac7b2ae1fef34a706
Transactions (5)
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.311 × 10¹⁰⁶(107-digit number)
13116587872713164143…40564388215494182851
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.311 × 10¹⁰⁶(107-digit number)
13116587872713164143…40564388215494182851
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.623 × 10¹⁰⁶(107-digit number)
26233175745426328286…81128776430988365701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.246 × 10¹⁰⁶(107-digit number)
52466351490852656572…62257552861976731401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.049 × 10¹⁰⁷(108-digit number)
10493270298170531314…24515105723953462801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.098 × 10¹⁰⁷(108-digit number)
20986540596341062628…49030211447906925601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.197 × 10¹⁰⁷(108-digit number)
41973081192682125257…98060422895813851201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.394 × 10¹⁰⁷(108-digit number)
83946162385364250515…96120845791627702401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.678 × 10¹⁰⁸(109-digit number)
16789232477072850103…92241691583255404801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.357 × 10¹⁰⁸(109-digit number)
33578464954145700206…84483383166510809601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.715 × 10¹⁰⁸(109-digit number)
67156929908291400412…68966766333021619201
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,771,889 XPM·at block #6,815,971 · 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.
Privacy Policy·

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