Block #446,149

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/16/2014, 8:48:55 AM · Difficulty 10.3618 · 6,364,207 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
03524ff2b24c882e3ea988a32374f7a2e303bd9a9bf89a3585c26f434bd025ec

Height

#446,149

Difficulty

10.361842

Transactions

3

Size

5.12 KB

Version

2

Bits

0a5ca1ae

Nonce

6,099

Timestamp

3/16/2014, 8:48:55 AM

Confirmations

6,364,207

Merkle Root

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

1.120 × 10⁹⁷(98-digit number)
11203187733131469593…22050087087583295821
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.120 × 10⁹⁷(98-digit number)
11203187733131469593…22050087087583295821
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.240 × 10⁹⁷(98-digit number)
22406375466262939186…44100174175166591641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.481 × 10⁹⁷(98-digit number)
44812750932525878373…88200348350333183281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.962 × 10⁹⁷(98-digit number)
89625501865051756747…76400696700666366561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.792 × 10⁹⁸(99-digit number)
17925100373010351349…52801393401332733121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.585 × 10⁹⁸(99-digit number)
35850200746020702699…05602786802665466241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.170 × 10⁹⁸(99-digit number)
71700401492041405398…11205573605330932481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.434 × 10⁹⁹(100-digit number)
14340080298408281079…22411147210661864961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.868 × 10⁹⁹(100-digit number)
28680160596816562159…44822294421323729921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.736 × 10⁹⁹(100-digit number)
57360321193633124318…89644588842647459841
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,726,922 XPM·at block #6,810,355 · 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