Block #445,899

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/16/2014, 5:03:19 AM · Difficulty 10.3589 · 6,370,275 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
24972ab18d490ffa452bec71ee434ba2fd999332fb5a0a5f291c1728ecac2fc6

Height

#445,899

Difficulty

10.358893

Transactions

5

Size

7.55 KB

Version

2

Bits

0a5be06d

Nonce

457,614

Timestamp

3/16/2014, 5:03:19 AM

Confirmations

6,370,275

Merkle Root

cad7ec5d86e06085250b92138fdb1d5fb82ee654c4dc011e68cd5e53c60cf2df
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.809 × 10⁹⁸(99-digit number)
18094531723520235512…52839367954690825601
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.809 × 10⁹⁸(99-digit number)
18094531723520235512…52839367954690825601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.618 × 10⁹⁸(99-digit number)
36189063447040471024…05678735909381651201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.237 × 10⁹⁸(99-digit number)
72378126894080942049…11357471818763302401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.447 × 10⁹⁹(100-digit number)
14475625378816188409…22714943637526604801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.895 × 10⁹⁹(100-digit number)
28951250757632376819…45429887275053209601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.790 × 10⁹⁹(100-digit number)
57902501515264753639…90859774550106419201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.158 × 10¹⁰⁰(101-digit number)
11580500303052950727…81719549100212838401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.316 × 10¹⁰⁰(101-digit number)
23161000606105901455…63439098200425676801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.632 × 10¹⁰⁰(101-digit number)
46322001212211802911…26878196400851353601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.264 × 10¹⁰⁰(101-digit number)
92644002424423605823…53756392801702707201
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,516 XPM·at block #6,816,173 · 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