Block #403,489

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/14/2014, 5:33:12 AM · Difficulty 10.4276 · 6,404,865 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bf1e341d4715597660d6a37ff438f07fe91c81e8acd2b726f39ebeae0c3d74cb

Height

#403,489

Difficulty

10.427606

Transactions

3

Size

766 B

Version

2

Bits

0a6d779c

Nonce

151,164

Timestamp

2/14/2014, 5:33:12 AM

Confirmations

6,404,865

Merkle Root

1ada00e5c9ac33cb9dab227937a3c10bcbb1db262550fe82d3b959e4da2b7a80
Transactions (3)
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.

8.322 × 10⁹⁵(96-digit number)
83220911713841759690…83624135338645279361
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
8.322 × 10⁹⁵(96-digit number)
83220911713841759690…83624135338645279361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.664 × 10⁹⁶(97-digit number)
16644182342768351938…67248270677290558721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.328 × 10⁹⁶(97-digit number)
33288364685536703876…34496541354581117441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.657 × 10⁹⁶(97-digit number)
66576729371073407752…68993082709162234881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.331 × 10⁹⁷(98-digit number)
13315345874214681550…37986165418324469761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.663 × 10⁹⁷(98-digit number)
26630691748429363100…75972330836648939521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.326 × 10⁹⁷(98-digit number)
53261383496858726201…51944661673297879041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.065 × 10⁹⁸(99-digit number)
10652276699371745240…03889323346595758081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.130 × 10⁹⁸(99-digit number)
21304553398743490480…07778646693191516161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.260 × 10⁹⁸(99-digit number)
42609106797486980961…15557293386383032321
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,710,891 XPM·at block #6,808,353 · 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