Block #259,286

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/13/2013, 1:11:17 PM · Difficulty 9.9772 · 6,558,156 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1f03cd3cdef7d75c2d9889cdb00247ba57774172c31e52c5fd4d3fca22a94662

Height

#259,286

Difficulty

9.977162

Transactions

2

Size

721 B

Version

2

Bits

09fa2748

Nonce

63,885

Timestamp

11/13/2013, 1:11:17 PM

Confirmations

6,558,156

Merkle Root

28d1836e30690845ba6c01a0cd97b6d128a764dce9808e946905efa37d61a553
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.

1.435 × 10⁹⁶(97-digit number)
14350644946367755170…33328215086561316019
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
1.435 × 10⁹⁶(97-digit number)
14350644946367755170…33328215086561316019
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.870 × 10⁹⁶(97-digit number)
28701289892735510341…66656430173122632039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.740 × 10⁹⁶(97-digit number)
57402579785471020682…33312860346245264079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.148 × 10⁹⁷(98-digit number)
11480515957094204136…66625720692490528159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.296 × 10⁹⁷(98-digit number)
22961031914188408273…33251441384981056319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.592 × 10⁹⁷(98-digit number)
45922063828376816546…66502882769962112639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.184 × 10⁹⁷(98-digit number)
91844127656753633092…33005765539924225279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.836 × 10⁹⁸(99-digit number)
18368825531350726618…66011531079848450559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.673 × 10⁹⁸(99-digit number)
36737651062701453236…32023062159696901119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.347 × 10⁹⁸(99-digit number)
73475302125402906473…64046124319393802239
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,783,583 XPM·at block #6,817,441 · 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