Block #336,478

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/30/2013, 11:51:01 PM · Difficulty 10.1427 · 6,479,958 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
307e48bb8664a9c353f0ac4990cbca7865b2452298eec1355357f13766ca99d0

Height

#336,478

Difficulty

10.142692

Transactions

15

Size

4.67 KB

Version

2

Bits

0a248771

Nonce

135,512

Timestamp

12/30/2013, 11:51:01 PM

Confirmations

6,479,958

Merkle Root

897114ab28e643c82fcd9e8955e43fc8c9d8c58846a605c7894974899edc1cdc
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.941 × 10¹⁰³(104-digit number)
19418403430219424796…01845777985472632001
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.941 × 10¹⁰³(104-digit number)
19418403430219424796…01845777985472632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.883 × 10¹⁰³(104-digit number)
38836806860438849592…03691555970945264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.767 × 10¹⁰³(104-digit number)
77673613720877699184…07383111941890528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.553 × 10¹⁰⁴(105-digit number)
15534722744175539836…14766223883781056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.106 × 10¹⁰⁴(105-digit number)
31069445488351079673…29532447767562112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.213 × 10¹⁰⁴(105-digit number)
62138890976702159347…59064895535124224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.242 × 10¹⁰⁵(106-digit number)
12427778195340431869…18129791070248448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.485 × 10¹⁰⁵(106-digit number)
24855556390680863739…36259582140496896001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.971 × 10¹⁰⁵(106-digit number)
49711112781361727478…72519164280993792001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.942 × 10¹⁰⁵(106-digit number)
99422225562723454956…45038328561987584001
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,775,613 XPM·at block #6,816,435 · 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