Block #440,127

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/12/2014, 5:17:15 AM · Difficulty 10.3519 · 6,368,054 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f8e102e0402168bb9dd4932182a970b84030a3427e6242fea6c9fc03163d43c5

Height

#440,127

Difficulty

10.351869

Transactions

3

Size

1.06 KB

Version

2

Bits

0a5a1418

Nonce

22,128

Timestamp

3/12/2014, 5:17:15 AM

Confirmations

6,368,054

Merkle Root

45baf02c2e551eedf5173b7de6760fe70f7a2ea19a707c16967e4dd2df971a12
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.

5.273 × 10⁹⁷(98-digit number)
52733196344667454572…83302296644811652841
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
5.273 × 10⁹⁷(98-digit number)
52733196344667454572…83302296644811652841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.054 × 10⁹⁸(99-digit number)
10546639268933490914…66604593289623305681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.109 × 10⁹⁸(99-digit number)
21093278537866981828…33209186579246611361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.218 × 10⁹⁸(99-digit number)
42186557075733963657…66418373158493222721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.437 × 10⁹⁸(99-digit number)
84373114151467927315…32836746316986445441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.687 × 10⁹⁹(100-digit number)
16874622830293585463…65673492633972890881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.374 × 10⁹⁹(100-digit number)
33749245660587170926…31346985267945781761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.749 × 10⁹⁹(100-digit number)
67498491321174341852…62693970535891563521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.349 × 10¹⁰⁰(101-digit number)
13499698264234868370…25387941071783127041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.699 × 10¹⁰⁰(101-digit number)
26999396528469736741…50775882143566254081
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,709,497 XPM·at block #6,808,180 · 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