Block #841,858

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/6/2014, 4:51:20 AM · Difficulty 10.9739 · 5,974,324 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a1d4ff25e3233417a5c188b49f94014da477755aaa10c64444005480498732b8

Height

#841,858

Difficulty

10.973910

Transactions

2

Size

433 B

Version

2

Bits

0af95231

Nonce

375,247,728

Timestamp

12/6/2014, 4:51:20 AM

Confirmations

5,974,324

Merkle Root

21737dd7a0e724299ce423fe44be49d7dbb9daa11e98ebb4a2d6fd953596e567
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.828 × 10⁹⁵(96-digit number)
18283375406985590862…68234371291228110839
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.828 × 10⁹⁵(96-digit number)
18283375406985590862…68234371291228110839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.656 × 10⁹⁵(96-digit number)
36566750813971181724…36468742582456221679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.313 × 10⁹⁵(96-digit number)
73133501627942363448…72937485164912443359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.462 × 10⁹⁶(97-digit number)
14626700325588472689…45874970329824886719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.925 × 10⁹⁶(97-digit number)
29253400651176945379…91749940659649773439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.850 × 10⁹⁶(97-digit number)
58506801302353890759…83499881319299546879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.170 × 10⁹⁷(98-digit number)
11701360260470778151…66999762638599093759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.340 × 10⁹⁷(98-digit number)
23402720520941556303…33999525277198187519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.680 × 10⁹⁷(98-digit number)
46805441041883112607…67999050554396375039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.361 × 10⁹⁷(98-digit number)
93610882083766225214…35998101108792750079
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,773,581 XPM·at block #6,816,181 · 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