Block #239,545

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/2/2013, 4:06:10 AM · Difficulty 9.9545 · 6,570,377 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
30b8aec05c7a71bf037beadfefb99b09e80e156f59b7af3ee94a4bc5314d0187

Height

#239,545

Difficulty

9.954515

Transactions

5

Size

54.03 KB

Version

2

Bits

09f45b1a

Nonce

43,127

Timestamp

11/2/2013, 4:06:10 AM

Confirmations

6,570,377

Merkle Root

96d3dd092b4de41e47fff7f8ef0a9e0c025dcac04c308a9d498cb85e8a072e11
Transactions (5)
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.143 × 10⁹¹(92-digit number)
21438977812413824173…59287098298225429359
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.143 × 10⁹¹(92-digit number)
21438977812413824173…59287098298225429359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.287 × 10⁹¹(92-digit number)
42877955624827648347…18574196596450858719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.575 × 10⁹¹(92-digit number)
85755911249655296694…37148393192901717439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.715 × 10⁹²(93-digit number)
17151182249931059338…74296786385803434879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.430 × 10⁹²(93-digit number)
34302364499862118677…48593572771606869759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.860 × 10⁹²(93-digit number)
68604728999724237355…97187145543213739519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.372 × 10⁹³(94-digit number)
13720945799944847471…94374291086427479039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.744 × 10⁹³(94-digit number)
27441891599889694942…88748582172854958079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.488 × 10⁹³(94-digit number)
54883783199779389884…77497164345709916159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.097 × 10⁹⁴(95-digit number)
10976756639955877976…54994328691419832319
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,723,461 XPM·at block #6,809,921 · 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