Block #388,193

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/3/2014, 3:26:27 PM · Difficulty 10.4180 · 6,424,276 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
521a57cc1f5c79ed5fae703d379ac57e314e13b396e438f4509ea17b352d2d56

Height

#388,193

Difficulty

10.418007

Transactions

6

Size

1.24 KB

Version

2

Bits

0a6b027a

Nonce

222,564

Timestamp

2/3/2014, 3:26:27 PM

Confirmations

6,424,276

Merkle Root

75ba60dc485278bcd13cd65e0fa7085f0d9ee28997f097365b72e487736c3fe5
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.305 × 10¹⁰⁴(105-digit number)
33056332559485000368…54896535060856388701
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.305 × 10¹⁰⁴(105-digit number)
33056332559485000368…54896535060856388701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.611 × 10¹⁰⁴(105-digit number)
66112665118970000737…09793070121712777401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.322 × 10¹⁰⁵(106-digit number)
13222533023794000147…19586140243425554801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.644 × 10¹⁰⁵(106-digit number)
26445066047588000294…39172280486851109601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.289 × 10¹⁰⁵(106-digit number)
52890132095176000589…78344560973702219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.057 × 10¹⁰⁶(107-digit number)
10578026419035200117…56689121947404438401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.115 × 10¹⁰⁶(107-digit number)
21156052838070400235…13378243894808876801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.231 × 10¹⁰⁶(107-digit number)
42312105676140800471…26756487789617753601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.462 × 10¹⁰⁶(107-digit number)
84624211352281600943…53512975579235507201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.692 × 10¹⁰⁷(108-digit number)
16924842270456320188…07025951158471014401
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,743,778 XPM·at block #6,812,468 · 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