Block #456,272

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/23/2014, 2:51:37 AM · Difficulty 10.4168 · 6,353,775 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
88948417606378717af3f8c1a41fa0fd1f0520bfb1f2958b2eb1c5ea6e16739e

Height

#456,272

Difficulty

10.416789

Transactions

4

Size

1.50 KB

Version

2

Bits

0a6ab2ae

Nonce

336,140

Timestamp

3/23/2014, 2:51:37 AM

Confirmations

6,353,775

Merkle Root

8393fa60cdd43dc7d7f9b8e18db6b3963d817410afdf5ec006cbe78704c74eab
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.342 × 10⁹⁵(96-digit number)
13426625984950592794…24346475205462945281
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.342 × 10⁹⁵(96-digit number)
13426625984950592794…24346475205462945281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.685 × 10⁹⁵(96-digit number)
26853251969901185589…48692950410925890561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.370 × 10⁹⁵(96-digit number)
53706503939802371178…97385900821851781121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.074 × 10⁹⁶(97-digit number)
10741300787960474235…94771801643703562241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.148 × 10⁹⁶(97-digit number)
21482601575920948471…89543603287407124481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.296 × 10⁹⁶(97-digit number)
42965203151841896942…79087206574814248961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.593 × 10⁹⁶(97-digit number)
85930406303683793885…58174413149628497921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.718 × 10⁹⁷(98-digit number)
17186081260736758777…16348826299256995841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.437 × 10⁹⁷(98-digit number)
34372162521473517554…32697652598513991681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.874 × 10⁹⁷(98-digit number)
68744325042947035108…65395305197027983361
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,724,448 XPM·at block #6,810,046 · 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