Block #258,927

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/13/2013, 8:21:12 AM · Difficulty 9.9768 · 6,557,372 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
530e889a80e62d7dad88ff6702204f3f8fa4ca10743f0401a7e9affe5695c988

Height

#258,927

Difficulty

9.976829

Transactions

1

Size

1.94 KB

Version

2

Bits

09fa117c

Nonce

110,845

Timestamp

11/13/2013, 8:21:12 AM

Confirmations

6,557,372

Merkle Root

607c4da1b4da1c0024b8a452ce4116cc1a890507017386127f13390ae7b20909
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.

4.962 × 10⁹⁰(91-digit number)
49626427509691568051…96012199569326902999
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
4.962 × 10⁹⁰(91-digit number)
49626427509691568051…96012199569326902999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.925 × 10⁹⁰(91-digit number)
99252855019383136103…92024399138653805999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.985 × 10⁹¹(92-digit number)
19850571003876627220…84048798277307611999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.970 × 10⁹¹(92-digit number)
39701142007753254441…68097596554615223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.940 × 10⁹¹(92-digit number)
79402284015506508882…36195193109230447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.588 × 10⁹²(93-digit number)
15880456803101301776…72390386218460895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.176 × 10⁹²(93-digit number)
31760913606202603553…44780772436921791999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.352 × 10⁹²(93-digit number)
63521827212405207106…89561544873843583999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.270 × 10⁹³(94-digit number)
12704365442481041421…79123089747687167999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.540 × 10⁹³(94-digit number)
25408730884962082842…58246179495374335999
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,774,511 XPM·at block #6,816,298 · 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