Block #263,254

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/17/2013, 3:26:00 PM · Difficulty 9.9667 · 6,563,621 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c8949a8c402bce532c1e20f94d5e26039e47c1c30e1545783a348cd9803c39db

Height

#263,254

Difficulty

9.966684

Transactions

2

Size

425 B

Version

2

Bits

09f778a2

Nonce

811

Timestamp

11/17/2013, 3:26:00 PM

Confirmations

6,563,621

Merkle Root

2761667f3dcbf2308697fc9ac07736cd1828cec72efb062bc7d4a58e2ade4c3f
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.

4.170 × 10⁹⁶(97-digit number)
41708550274767561475…52031440662832424001
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
4.170 × 10⁹⁶(97-digit number)
41708550274767561475…52031440662832424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.341 × 10⁹⁶(97-digit number)
83417100549535122950…04062881325664848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.668 × 10⁹⁷(98-digit number)
16683420109907024590…08125762651329696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.336 × 10⁹⁷(98-digit number)
33366840219814049180…16251525302659392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.673 × 10⁹⁷(98-digit number)
66733680439628098360…32503050605318784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.334 × 10⁹⁸(99-digit number)
13346736087925619672…65006101210637568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.669 × 10⁹⁸(99-digit number)
26693472175851239344…30012202421275136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.338 × 10⁹⁸(99-digit number)
53386944351702478688…60024404842550272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.067 × 10⁹⁹(100-digit number)
10677388870340495737…20048809685100544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.135 × 10⁹⁹(100-digit number)
21354777740680991475…40097619370201088001
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,859,163 XPM·at block #6,826,874 · 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