Block #259,949

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/13/2013, 10:18:09 PM · Difficulty 9.9777 · 6,557,799 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f41a6c74bc670dc4ad675d47ade30547b598147ba99b2f2ecd9f3b998808b659

Height

#259,949

Difficulty

9.977694

Transactions

2

Size

721 B

Version

2

Bits

09fa4a2a

Nonce

230,648

Timestamp

11/13/2013, 10:18:09 PM

Confirmations

6,557,799

Merkle Root

59f2b6b490a07d13b1937d33272df185cce0224680aac36b971c66e1be5bdba2
Transactions (2)
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.548 × 10⁹³(94-digit number)
25482457748781188076…40650888759735440079
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.548 × 10⁹³(94-digit number)
25482457748781188076…40650888759735440079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.096 × 10⁹³(94-digit number)
50964915497562376152…81301777519470880159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.019 × 10⁹⁴(95-digit number)
10192983099512475230…62603555038941760319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.038 × 10⁹⁴(95-digit number)
20385966199024950460…25207110077883520639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.077 × 10⁹⁴(95-digit number)
40771932398049900921…50414220155767041279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.154 × 10⁹⁴(95-digit number)
81543864796099801843…00828440311534082559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.630 × 10⁹⁵(96-digit number)
16308772959219960368…01656880623068165119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.261 × 10⁹⁵(96-digit number)
32617545918439920737…03313761246136330239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.523 × 10⁹⁵(96-digit number)
65235091836879841474…06627522492272660479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.304 × 10⁹⁶(97-digit number)
13047018367375968294…13255044984545320959
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,786,038 XPM·at block #6,817,747 · 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