Block #259,008

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/13/2013, 9:27:44 AM · Difficulty 9.9769 · 6,547,312 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4e7cfe7bf6ee843d4595e2d90087e78760226ec2013ac7ffc9becfc560240880

Height

#259,008

Difficulty

9.976896

Transactions

3

Size

3.19 KB

Version

2

Bits

09fa15df

Nonce

188

Timestamp

11/13/2013, 9:27:44 AM

Confirmations

6,547,312

Merkle Root

ea2218f49de4b55e684dcfc8f5b71a1e5ca0150685f3d43b1d3ae7edcd26adc0
Transactions (3)
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.

6.919 × 10⁹⁶(97-digit number)
69192884128811361695…75290039675674922241
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
6.919 × 10⁹⁶(97-digit number)
69192884128811361695…75290039675674922241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.383 × 10⁹⁷(98-digit number)
13838576825762272339…50580079351349844481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.767 × 10⁹⁷(98-digit number)
27677153651524544678…01160158702699688961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.535 × 10⁹⁷(98-digit number)
55354307303049089356…02320317405399377921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.107 × 10⁹⁸(99-digit number)
11070861460609817871…04640634810798755841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.214 × 10⁹⁸(99-digit number)
22141722921219635742…09281269621597511681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.428 × 10⁹⁸(99-digit number)
44283445842439271485…18562539243195023361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.856 × 10⁹⁸(99-digit number)
88566891684878542970…37125078486390046721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.771 × 10⁹⁹(100-digit number)
17713378336975708594…74250156972780093441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.542 × 10⁹⁹(100-digit number)
35426756673951417188…48500313945560186881
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,694,642 XPM·at block #6,806,319 · 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