Block #289,906

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/2/2013, 10:33:48 AM · Difficulty 9.9889 · 6,541,759 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
72d2d2e44b7e89a3e57dbd9e430a3318480196c606ba88740a5a94340cb9ea45

Height

#289,906

Difficulty

9.988858

Transactions

4

Size

3.61 KB

Version

2

Bits

09fd25ce

Nonce

71,406

Timestamp

12/2/2013, 10:33:48 AM

Confirmations

6,541,759

Merkle Root

2c996f2cb2948647d306cb65205907d71c62bee9e6ffa81625da24183fea3074
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.061 × 10⁹⁴(95-digit number)
20618851276719909107…57273203995603005439
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.061 × 10⁹⁴(95-digit number)
20618851276719909107…57273203995603005439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.123 × 10⁹⁴(95-digit number)
41237702553439818215…14546407991206010879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.247 × 10⁹⁴(95-digit number)
82475405106879636430…29092815982412021759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.649 × 10⁹⁵(96-digit number)
16495081021375927286…58185631964824043519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.299 × 10⁹⁵(96-digit number)
32990162042751854572…16371263929648087039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.598 × 10⁹⁵(96-digit number)
65980324085503709144…32742527859296174079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.319 × 10⁹⁶(97-digit number)
13196064817100741828…65485055718592348159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.639 × 10⁹⁶(97-digit number)
26392129634201483657…30970111437184696319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.278 × 10⁹⁶(97-digit number)
52784259268402967315…61940222874369392639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.055 × 10⁹⁷(98-digit number)
10556851853680593463…23880445748738785279
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,897,424 XPM·at block #6,831,664 · 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