Block #456,295

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/23/2014, 3:20:19 AM · Difficulty 10.4155 · 6,357,872 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3a4dcafcca4c9fa0884c8d9f3e5b42279419435ab482a1489bf500c06627af8b

Height

#456,295

Difficulty

10.415530

Transactions

8

Size

2.63 KB

Version

2

Bits

0a6a602c

Nonce

51,210

Timestamp

3/23/2014, 3:20:19 AM

Confirmations

6,357,872

Merkle Root

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

3.913 × 10⁹⁸(99-digit number)
39138929179749553409…49612259621642645921
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
3.913 × 10⁹⁸(99-digit number)
39138929179749553409…49612259621642645921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.827 × 10⁹⁸(99-digit number)
78277858359499106818…99224519243285291841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.565 × 10⁹⁹(100-digit number)
15655571671899821363…98449038486570583681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.131 × 10⁹⁹(100-digit number)
31311143343799642727…96898076973141167361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.262 × 10⁹⁹(100-digit number)
62622286687599285454…93796153946282334721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.252 × 10¹⁰⁰(101-digit number)
12524457337519857090…87592307892564669441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.504 × 10¹⁰⁰(101-digit number)
25048914675039714181…75184615785129338881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.009 × 10¹⁰⁰(101-digit number)
50097829350079428363…50369231570258677761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.001 × 10¹⁰¹(102-digit number)
10019565870015885672…00738463140517355521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.003 × 10¹⁰¹(102-digit number)
20039131740031771345…01476926281034711041
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,757,417 XPM·at block #6,814,166 · 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