Block #452,278

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/20/2014, 11:47:16 AM · Difficulty 10.3891 · 6,356,452 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
001e2ded2b301300389d9ac0ecddcd81ce9f562f631483ed060727f613b0ab2d

Height

#452,278

Difficulty

10.389061

Transactions

4

Size

1.95 KB

Version

2

Bits

0a63997a

Nonce

73,845

Timestamp

3/20/2014, 11:47:16 AM

Confirmations

6,356,452

Merkle Root

bd1965d0991dac9e12f233cfb5b0ccbe1e6cbc44b711e7c0e78abc4554897c7e
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.362 × 10⁹⁹(100-digit number)
13622467278724654824…28220051469425223681
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.362 × 10⁹⁹(100-digit number)
13622467278724654824…28220051469425223681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.724 × 10⁹⁹(100-digit number)
27244934557449309649…56440102938850447361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.448 × 10⁹⁹(100-digit number)
54489869114898619299…12880205877700894721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.089 × 10¹⁰⁰(101-digit number)
10897973822979723859…25760411755401789441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.179 × 10¹⁰⁰(101-digit number)
21795947645959447719…51520823510803578881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.359 × 10¹⁰⁰(101-digit number)
43591895291918895439…03041647021607157761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.718 × 10¹⁰⁰(101-digit number)
87183790583837790878…06083294043214315521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.743 × 10¹⁰¹(102-digit number)
17436758116767558175…12166588086428631041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.487 × 10¹⁰¹(102-digit number)
34873516233535116351…24333176172857262081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.974 × 10¹⁰¹(102-digit number)
69747032467070232703…48666352345714524161
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,713,886 XPM·at block #6,808,729 · 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