Block #262,289

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/16/2013, 4:50:38 PM · Difficulty 9.9691 · 6,553,515 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
636a543ca7c4166a1e85bb517815d95b5ff1e3d55b60d8f2e10930bb1def6c64

Height

#262,289

Difficulty

9.969147

Transactions

2

Size

390 B

Version

2

Bits

09f81a0a

Nonce

4,431

Timestamp

11/16/2013, 4:50:38 PM

Confirmations

6,553,515

Merkle Root

457407295d2bf997f6cdf5ebec85333ee51e81b0dc9ff07a6fbb304bcca35b3d
Transactions (2)
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.

2.499 × 10⁹⁵(96-digit number)
24997919680712177253…04594822281345476481
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
2.499 × 10⁹⁵(96-digit number)
24997919680712177253…04594822281345476481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.999 × 10⁹⁵(96-digit number)
49995839361424354506…09189644562690952961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.999 × 10⁹⁵(96-digit number)
99991678722848709013…18379289125381905921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.999 × 10⁹⁶(97-digit number)
19998335744569741802…36758578250763811841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.999 × 10⁹⁶(97-digit number)
39996671489139483605…73517156501527623681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.999 × 10⁹⁶(97-digit number)
79993342978278967210…47034313003055247361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.599 × 10⁹⁷(98-digit number)
15998668595655793442…94068626006110494721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.199 × 10⁹⁷(98-digit number)
31997337191311586884…88137252012220989441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.399 × 10⁹⁷(98-digit number)
63994674382623173768…76274504024441978881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.279 × 10⁹⁸(99-digit number)
12798934876524634753…52549008048883957761
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,770,538 XPM·at block #6,815,803 · 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