Block #285,517

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/30/2013, 12:49:23 PM · Difficulty 9.9844 · 6,530,471 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5a1c0033c5997a1923b6460409f673919d011e776b0c64a6d7501e1e8b91f4f2

Height

#285,517

Difficulty

9.984396

Transactions

3

Size

649 B

Version

2

Bits

09fc015f

Nonce

5,472

Timestamp

11/30/2013, 12:49:23 PM

Confirmations

6,530,471

Merkle Root

b5241e004d674d1a098e28b74a6c823bd14fbf16ddd7fa6967b093687a8e7d1e
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.425 × 10⁸⁹(90-digit number)
14258148645025508254…83666881836230687801
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.425 × 10⁸⁹(90-digit number)
14258148645025508254…83666881836230687801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.851 × 10⁸⁹(90-digit number)
28516297290051016508…67333763672461375601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.703 × 10⁸⁹(90-digit number)
57032594580102033016…34667527344922751201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.140 × 10⁹⁰(91-digit number)
11406518916020406603…69335054689845502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.281 × 10⁹⁰(91-digit number)
22813037832040813206…38670109379691004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.562 × 10⁹⁰(91-digit number)
45626075664081626412…77340218759382009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.125 × 10⁹⁰(91-digit number)
91252151328163252825…54680437518764019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.825 × 10⁹¹(92-digit number)
18250430265632650565…09360875037528038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.650 × 10⁹¹(92-digit number)
36500860531265301130…18721750075056076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.300 × 10⁹¹(92-digit number)
73001721062530602260…37443500150112153601
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,772,019 XPM·at block #6,815,987 · 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