Block #250,594

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/8/2013, 2:07:04 PM · Difficulty 9.9686 · 6,566,282 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4ff0bb4e394b08b1897185deaad60d32fd73e8b71172fce532f063a8988d6765

Height

#250,594

Difficulty

9.968608

Transactions

5

Size

1.83 KB

Version

2

Bits

09f7f6ab

Nonce

1,719

Timestamp

11/8/2013, 2:07:04 PM

Confirmations

6,566,282

Merkle Root

c3980a254af81a49c92f09c47603e0f29add33a818493e912952e2da07d4396d
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.685 × 10⁹⁷(98-digit number)
46853747138336871340…74796364144590917021
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.685 × 10⁹⁷(98-digit number)
46853747138336871340…74796364144590917021
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.370 × 10⁹⁷(98-digit number)
93707494276673742680…49592728289181834041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.874 × 10⁹⁸(99-digit number)
18741498855334748536…99185456578363668081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.748 × 10⁹⁸(99-digit number)
37482997710669497072…98370913156727336161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.496 × 10⁹⁸(99-digit number)
74965995421338994144…96741826313454672321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.499 × 10⁹⁹(100-digit number)
14993199084267798828…93483652626909344641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.998 × 10⁹⁹(100-digit number)
29986398168535597657…86967305253818689281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.997 × 10⁹⁹(100-digit number)
59972796337071195315…73934610507637378561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.199 × 10¹⁰⁰(101-digit number)
11994559267414239063…47869221015274757121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.398 × 10¹⁰⁰(101-digit number)
23989118534828478126…95738442030549514241
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,779,046 XPM·at block #6,816,875 · 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