Block #445,511

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/15/2014, 10:47:41 PM · Difficulty 10.3570 · 6,363,970 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6cd067ae73ba7f6f259a4f700101c2d1eb0e4e1b6c76e5b04c7f4f94b4a2cb7f

Height

#445,511

Difficulty

10.356992

Transactions

3

Size

1.42 KB

Version

2

Bits

0a5b63d2

Nonce

17,253,438

Timestamp

3/15/2014, 10:47:41 PM

Confirmations

6,363,970

Merkle Root

524f685e0cb2342440945f16d0ac056d094b172da3346415f1b54f414e2cf338
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.340 × 10⁹⁸(99-digit number)
83406718761397878659…68111947431029281921
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.340 × 10⁹⁸(99-digit number)
83406718761397878659…68111947431029281921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.668 × 10⁹⁹(100-digit number)
16681343752279575731…36223894862058563841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.336 × 10⁹⁹(100-digit number)
33362687504559151463…72447789724117127681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.672 × 10⁹⁹(100-digit number)
66725375009118302927…44895579448234255361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.334 × 10¹⁰⁰(101-digit number)
13345075001823660585…89791158896468510721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.669 × 10¹⁰⁰(101-digit number)
26690150003647321171…79582317792937021441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.338 × 10¹⁰⁰(101-digit number)
53380300007294642342…59164635585874042881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.067 × 10¹⁰¹(102-digit number)
10676060001458928468…18329271171748085761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.135 × 10¹⁰¹(102-digit number)
21352120002917856936…36658542343496171521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.270 × 10¹⁰¹(102-digit number)
42704240005835713873…73317084686992343041
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,719,919 XPM·at block #6,809,480 · 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