Block #452,256

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/20/2014, 11:20:04 AM · Difficulty 10.3895 · 6,362,079 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1d52fdc55a18f6f7f896eb0cbbf8d7ca2aea3d0e69aae49bc8e6ab65a342698c

Height

#452,256

Difficulty

10.389491

Transactions

7

Size

11.37 KB

Version

2

Bits

0a63b5b5

Nonce

54,257

Timestamp

3/20/2014, 11:20:04 AM

Confirmations

6,362,079

Merkle Root

dd081cc59e95fcf3c5d0575fb3592371625fb2ae719f653a92df910970ba31b2
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.350 × 10⁹⁹(100-digit number)
13501145312808370107…88227980974600990721
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.350 × 10⁹⁹(100-digit number)
13501145312808370107…88227980974600990721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.700 × 10⁹⁹(100-digit number)
27002290625616740215…76455961949201981441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.400 × 10⁹⁹(100-digit number)
54004581251233480430…52911923898403962881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.080 × 10¹⁰⁰(101-digit number)
10800916250246696086…05823847796807925761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.160 × 10¹⁰⁰(101-digit number)
21601832500493392172…11647695593615851521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.320 × 10¹⁰⁰(101-digit number)
43203665000986784344…23295391187231703041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.640 × 10¹⁰⁰(101-digit number)
86407330001973568688…46590782374463406081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.728 × 10¹⁰¹(102-digit number)
17281466000394713737…93181564748926812161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.456 × 10¹⁰¹(102-digit number)
34562932000789427475…86363129497853624321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.912 × 10¹⁰¹(102-digit number)
69125864001578854951…72726258995707248641
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,758,742 XPM·at block #6,814,334 · 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