Block #846,676

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/9/2014, 7:00:29 PM · Difficulty 10.9722 · 5,995,504 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
11cd5961b35ff455bf181daf6a869887438f13958958cabdd3e2c508e2aa1124

Height

#846,676

Difficulty

10.972182

Transactions

5

Size

1.09 KB

Version

2

Bits

0af8e0f1

Nonce

386,292,080

Timestamp

12/9/2014, 7:00:29 PM

Confirmations

5,995,504

Merkle Root

fc66c284b1a08a97fb4ff6263903009f9315c3f5f456c05e39a4befb52ca8e6a
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.484 × 10⁹⁴(95-digit number)
44846318959491285250…00638680868950271199
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.484 × 10⁹⁴(95-digit number)
44846318959491285250…00638680868950271199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.969 × 10⁹⁴(95-digit number)
89692637918982570501…01277361737900542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.793 × 10⁹⁵(96-digit number)
17938527583796514100…02554723475801084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.587 × 10⁹⁵(96-digit number)
35877055167593028200…05109446951602169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.175 × 10⁹⁵(96-digit number)
71754110335186056401…10218893903204339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.435 × 10⁹⁶(97-digit number)
14350822067037211280…20437787806408678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.870 × 10⁹⁶(97-digit number)
28701644134074422560…40875575612817356799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.740 × 10⁹⁶(97-digit number)
57403288268148845120…81751151225634713599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.148 × 10⁹⁷(98-digit number)
11480657653629769024…63502302451269427199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.296 × 10⁹⁷(98-digit number)
22961315307259538048…27004604902538854399
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,981,832 XPM·at block #6,842,179 · 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