Block #396,729

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/9/2014, 2:25:19 PM · Difficulty 10.4155 · 6,413,165 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9d95473236f506f8f2400c8a7a2802c558e6e50331ae33aab1641585966f510f

Height

#396,729

Difficulty

10.415452

Transactions

8

Size

4.80 KB

Version

2

Bits

0a6a5b09

Nonce

12,397

Timestamp

2/9/2014, 2:25:19 PM

Confirmations

6,413,165

Merkle Root

9d5455f0165318142cc4c6acc849ee4df7e09764f9141f6206d993bd7e21c4cc
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.284 × 10⁹⁹(100-digit number)
12847267416976087613…45649538513516791841
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.284 × 10⁹⁹(100-digit number)
12847267416976087613…45649538513516791841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.569 × 10⁹⁹(100-digit number)
25694534833952175227…91299077027033583681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.138 × 10⁹⁹(100-digit number)
51389069667904350454…82598154054067167361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.027 × 10¹⁰⁰(101-digit number)
10277813933580870090…65196308108134334721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.055 × 10¹⁰⁰(101-digit number)
20555627867161740181…30392616216268669441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.111 × 10¹⁰⁰(101-digit number)
41111255734323480363…60785232432537338881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.222 × 10¹⁰⁰(101-digit number)
82222511468646960727…21570464865074677761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.644 × 10¹⁰¹(102-digit number)
16444502293729392145…43140929730149355521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.288 × 10¹⁰¹(102-digit number)
32889004587458784291…86281859460298711041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.577 × 10¹⁰¹(102-digit number)
65778009174917568582…72563718920597422081
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,723,233 XPM·at block #6,809,893 · 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