Block #339,153

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/1/2014, 9:54:10 PM · Difficulty 10.1290 · 6,473,423 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7508ee84d89f8641912aa570e386685e84d21f974d687552802511008790aab9

Height

#339,153

Difficulty

10.128964

Transactions

9

Size

1.96 KB

Version

2

Bits

0a2103c5

Nonce

205,644

Timestamp

1/1/2014, 9:54:10 PM

Confirmations

6,473,423

Merkle Root

dddd9152017eed061fe089f781b51df1340a0331cc0175e2fff7aa8cb8634319
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.

3.668 × 10¹⁰²(103-digit number)
36686723052821032596…45581208428165263681
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
3.668 × 10¹⁰²(103-digit number)
36686723052821032596…45581208428165263681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.337 × 10¹⁰²(103-digit number)
73373446105642065192…91162416856330527361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.467 × 10¹⁰³(104-digit number)
14674689221128413038…82324833712661054721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.934 × 10¹⁰³(104-digit number)
29349378442256826077…64649667425322109441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.869 × 10¹⁰³(104-digit number)
58698756884513652154…29299334850644218881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.173 × 10¹⁰⁴(105-digit number)
11739751376902730430…58598669701288437761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.347 × 10¹⁰⁴(105-digit number)
23479502753805460861…17197339402576875521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.695 × 10¹⁰⁴(105-digit number)
46959005507610921723…34394678805153751041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.391 × 10¹⁰⁴(105-digit number)
93918011015221843446…68789357610307502081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.878 × 10¹⁰⁵(106-digit number)
18783602203044368689…37578715220615004161
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,744,642 XPM·at block #6,812,575 · 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