Block #450,176

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/19/2014, 3:03:06 AM · Difficulty 10.3703 · 6,365,955 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
68c7ed1c151de984a9c58887e5e1eeabdf3e61623b51f87445622eb91b9e5054

Height

#450,176

Difficulty

10.370337

Transactions

1

Size

934 B

Version

2

Bits

0a5ece66

Nonce

568,843

Timestamp

3/19/2014, 3:03:06 AM

Confirmations

6,365,955

Merkle Root

ed05f3bf72b1c81cc7c01d283d5ff12c6f485fd55e20c05a7b3ebb640ea3b8b2
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.137 × 10⁹²(93-digit number)
11376941291014392095…34038917176735024141
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.137 × 10⁹²(93-digit number)
11376941291014392095…34038917176735024141
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.275 × 10⁹²(93-digit number)
22753882582028784190…68077834353470048281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.550 × 10⁹²(93-digit number)
45507765164057568381…36155668706940096561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.101 × 10⁹²(93-digit number)
91015530328115136763…72311337413880193121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.820 × 10⁹³(94-digit number)
18203106065623027352…44622674827760386241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.640 × 10⁹³(94-digit number)
36406212131246054705…89245349655520772481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.281 × 10⁹³(94-digit number)
72812424262492109411…78490699311041544961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.456 × 10⁹⁴(95-digit number)
14562484852498421882…56981398622083089921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.912 × 10⁹⁴(95-digit number)
29124969704996843764…13962797244166179841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.824 × 10⁹⁴(95-digit number)
58249939409993687528…27925594488332359681
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,773,174 XPM·at block #6,816,130 · 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