Block #859,693

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/19/2014, 4:12:15 PM · Difficulty 10.9651 · 5,958,279 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8939222351f25bbea3b19888d299d610075b29a4eeb7ee721555029d206fc295

Height

#859,693

Difficulty

10.965075

Transactions

7

Size

5.56 KB

Version

2

Bits

0af70f2d

Nonce

751,858,882

Timestamp

12/19/2014, 4:12:15 PM

Confirmations

5,958,279

Merkle Root

bbdb05941c1d2257831155309237d36035e12f335bf2ec32e223b529b72c1603
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.561 × 10⁹⁴(95-digit number)
25617251471975223711…64168919204034845139
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.561 × 10⁹⁴(95-digit number)
25617251471975223711…64168919204034845139
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.123 × 10⁹⁴(95-digit number)
51234502943950447422…28337838408069690279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.024 × 10⁹⁵(96-digit number)
10246900588790089484…56675676816139380559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.049 × 10⁹⁵(96-digit number)
20493801177580178968…13351353632278761119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.098 × 10⁹⁵(96-digit number)
40987602355160357937…26702707264557522239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.197 × 10⁹⁵(96-digit number)
81975204710320715875…53405414529115044479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.639 × 10⁹⁶(97-digit number)
16395040942064143175…06810829058230088959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.279 × 10⁹⁶(97-digit number)
32790081884128286350…13621658116460177919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.558 × 10⁹⁶(97-digit number)
65580163768256572700…27243316232920355839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.311 × 10⁹⁷(98-digit number)
13116032753651314540…54486632465840711679
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,787,846 XPM·at block #6,817,971 · 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