Block #288,750

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/1/2013, 9:48:34 PM · Difficulty 9.9879 · 6,536,946 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f20069b2d25effb07e55ab5ffebaad9359d3c7b6f06d1fea29e837628848fb4c

Height

#288,750

Difficulty

9.987923

Transactions

11

Size

3.01 KB

Version

2

Bits

09fce887

Nonce

77,111

Timestamp

12/1/2013, 9:48:34 PM

Confirmations

6,536,946

Merkle Root

f4378b4c5f1f29025eda1754657155fab21cab7afe19195be09a0d115b7b3ea8
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.193 × 10¹⁰⁰(101-digit number)
61931814021526370086…37406273557799375461
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.193 × 10¹⁰⁰(101-digit number)
61931814021526370086…37406273557799375461
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.238 × 10¹⁰¹(102-digit number)
12386362804305274017…74812547115598750921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.477 × 10¹⁰¹(102-digit number)
24772725608610548034…49625094231197501841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.954 × 10¹⁰¹(102-digit number)
49545451217221096069…99250188462395003681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.909 × 10¹⁰¹(102-digit number)
99090902434442192138…98500376924790007361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.981 × 10¹⁰²(103-digit number)
19818180486888438427…97000753849580014721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.963 × 10¹⁰²(103-digit number)
39636360973776876855…94001507699160029441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.927 × 10¹⁰²(103-digit number)
79272721947553753710…88003015398320058881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.585 × 10¹⁰³(104-digit number)
15854544389510750742…76006030796640117761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.170 × 10¹⁰³(104-digit number)
31709088779021501484…52012061593280235521
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,849,680 XPM·at block #6,825,695 · 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