Block #446,666

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/16/2014, 5:45:09 PM · Difficulty 10.3595 · 6,368,438 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d11e1ef9bf5fd0e9522b8b94eb0d2b6ebc89a629ffc3e81ac6cca75c9e2bc975

Height

#446,666

Difficulty

10.359481

Transactions

10

Size

2.34 KB

Version

2

Bits

0a5c06ef

Nonce

138,769

Timestamp

3/16/2014, 5:45:09 PM

Confirmations

6,368,438

Merkle Root

c5ac323057f48b1144cea839cafcd40d1747b08d4a5cb1eb57737d20e26b64d4
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.

4.640 × 10⁹⁹(100-digit number)
46408859416665598837…08109227110900500481
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
4.640 × 10⁹⁹(100-digit number)
46408859416665598837…08109227110900500481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.281 × 10⁹⁹(100-digit number)
92817718833331197675…16218454221801000961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.856 × 10¹⁰⁰(101-digit number)
18563543766666239535…32436908443602001921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.712 × 10¹⁰⁰(101-digit number)
37127087533332479070…64873816887204003841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.425 × 10¹⁰⁰(101-digit number)
74254175066664958140…29747633774408007681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.485 × 10¹⁰¹(102-digit number)
14850835013332991628…59495267548816015361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.970 × 10¹⁰¹(102-digit number)
29701670026665983256…18990535097632030721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.940 × 10¹⁰¹(102-digit number)
59403340053331966512…37981070195264061441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.188 × 10¹⁰²(103-digit number)
11880668010666393302…75962140390528122881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.376 × 10¹⁰²(103-digit number)
23761336021332786604…51924280781056245761
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,764,922 XPM·at block #6,815,103 · 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