Block #265,129

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/19/2013, 7:20:46 AM · Difficulty 9.9632 · 6,542,216 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5c30980d27fcf0ab7f76d31818061998f97257ad7b41a97309282f5d347088b5

Height

#265,129

Difficulty

9.963162

Transactions

8

Size

5.28 KB

Version

2

Bits

09f691ca

Nonce

162,113

Timestamp

11/19/2013, 7:20:46 AM

Confirmations

6,542,216

Merkle Root

c4ede5c453d74cf046d128e31b20f441fbb286db8d07d3b9077a453b2b8ab37b
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.

9.547 × 10⁹⁴(95-digit number)
95479988573911159994…68681878861428722521
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
9.547 × 10⁹⁴(95-digit number)
95479988573911159994…68681878861428722521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.909 × 10⁹⁵(96-digit number)
19095997714782231998…37363757722857445041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.819 × 10⁹⁵(96-digit number)
38191995429564463997…74727515445714890081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.638 × 10⁹⁵(96-digit number)
76383990859128927995…49455030891429780161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.527 × 10⁹⁶(97-digit number)
15276798171825785599…98910061782859560321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.055 × 10⁹⁶(97-digit number)
30553596343651571198…97820123565719120641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.110 × 10⁹⁶(97-digit number)
61107192687303142396…95640247131438241281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.222 × 10⁹⁷(98-digit number)
12221438537460628479…91280494262876482561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.444 × 10⁹⁷(98-digit number)
24442877074921256958…82560988525752965121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.888 × 10⁹⁷(98-digit number)
48885754149842513917…65121977051505930241
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,702,780 XPM·at block #6,807,344 · 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