Block #841,135

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/5/2014, 4:08:38 PM · Difficulty 10.9741 · 6,000,067 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e876b66931ea512ffe043f03f8a1b8ced11d1e0d6d5f2c6aebb6af5340c3a6a1

Height

#841,135

Difficulty

10.974101

Transactions

3

Size

652 B

Version

2

Bits

0af95eb6

Nonce

190,141,336

Timestamp

12/5/2014, 4:08:38 PM

Confirmations

6,000,067

Merkle Root

a8e39e2f7c415fd49f9db0f66b171049798ae70fab5bc7be415c0bbb95e065b9
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.104 × 10⁹⁴(95-digit number)
11049784745077528651…68407986574242678879
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.104 × 10⁹⁴(95-digit number)
11049784745077528651…68407986574242678879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.209 × 10⁹⁴(95-digit number)
22099569490155057302…36815973148485357759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.419 × 10⁹⁴(95-digit number)
44199138980310114605…73631946296970715519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.839 × 10⁹⁴(95-digit number)
88398277960620229211…47263892593941431039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.767 × 10⁹⁵(96-digit number)
17679655592124045842…94527785187882862079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.535 × 10⁹⁵(96-digit number)
35359311184248091684…89055570375765724159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.071 × 10⁹⁵(96-digit number)
70718622368496183369…78111140751531448319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.414 × 10⁹⁶(97-digit number)
14143724473699236673…56222281503062896639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.828 × 10⁹⁶(97-digit number)
28287448947398473347…12444563006125793279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.657 × 10⁹⁶(97-digit number)
56574897894796946695…24889126012251586559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.131 × 10⁹⁷(98-digit number)
11314979578959389339…49778252024503173119
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,973,977 XPM·at block #6,841,201 · 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