Block #288,423

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/1/2013, 5:54:08 PM · Difficulty 9.9877 · 6,537,048 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
55ccc2db2775b2f6434058bfee68305ceeacd29787899f84055c7dddac00569f

Height

#288,423

Difficulty

9.987690

Transactions

29

Size

6.99 KB

Version

2

Bits

09fcd940

Nonce

3,673

Timestamp

12/1/2013, 5:54:08 PM

Confirmations

6,537,048

Merkle Root

21878fd9f85f3350b32b66e687b9c7363e6ef526ac68afeeee8a61542b859a29
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.

5.044 × 10⁹²(93-digit number)
50441841198077298674…15345367055019520001
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
5.044 × 10⁹²(93-digit number)
50441841198077298674…15345367055019520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.008 × 10⁹³(94-digit number)
10088368239615459734…30690734110039040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.017 × 10⁹³(94-digit number)
20176736479230919469…61381468220078080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.035 × 10⁹³(94-digit number)
40353472958461838939…22762936440156160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.070 × 10⁹³(94-digit number)
80706945916923677879…45525872880312320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.614 × 10⁹⁴(95-digit number)
16141389183384735575…91051745760624640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.228 × 10⁹⁴(95-digit number)
32282778366769471151…82103491521249280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.456 × 10⁹⁴(95-digit number)
64565556733538942303…64206983042498560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.291 × 10⁹⁵(96-digit number)
12913111346707788460…28413966084997120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.582 × 10⁹⁵(96-digit number)
25826222693415576921…56827932169994240001
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,847,861 XPM·at block #6,825,470 · 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