Block #457,891

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2014, 5:19:17 AM · Difficulty 10.4209 · 6,367,014 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
863ad38cd4bbe444b89a563503db68e728efaab4f97c3858d17f7c02aa9357c8

Height

#457,891

Difficulty

10.420862

Transactions

9

Size

5.45 KB

Version

2

Bits

0a6bbd9a

Nonce

81,547

Timestamp

3/24/2014, 5:19:17 AM

Confirmations

6,367,014

Merkle Root

47d4e27c845fa3940689584ec470a1b600480b5f6bc79df670d502caba8825fa
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.

2.443 × 10⁹⁹(100-digit number)
24433042477089435786…52808910908135901281
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
2.443 × 10⁹⁹(100-digit number)
24433042477089435786…52808910908135901281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.886 × 10⁹⁹(100-digit number)
48866084954178871573…05617821816271802561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.773 × 10⁹⁹(100-digit number)
97732169908357743147…11235643632543605121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.954 × 10¹⁰⁰(101-digit number)
19546433981671548629…22471287265087210241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.909 × 10¹⁰⁰(101-digit number)
39092867963343097258…44942574530174420481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.818 × 10¹⁰⁰(101-digit number)
78185735926686194517…89885149060348840961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.563 × 10¹⁰¹(102-digit number)
15637147185337238903…79770298120697681921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.127 × 10¹⁰¹(102-digit number)
31274294370674477807…59540596241395363841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.254 × 10¹⁰¹(102-digit number)
62548588741348955614…19081192482790727681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.250 × 10¹⁰²(103-digit number)
12509717748269791122…38162384965581455361
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,843,323 XPM·at block #6,824,904 · 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