Block #849,016

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2014, 12:51:01 PM · Difficulty 10.9713 · 5,984,358 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
65e1a079e777fa52d5b854ddd2888274b1a17847700819f8e0e650bd15cbba72

Height

#849,016

Difficulty

10.971290

Transactions

15

Size

4.24 KB

Version

2

Bits

0af8a67a

Nonce

661,337,830

Timestamp

12/11/2014, 12:51:01 PM

Confirmations

5,984,358

Merkle Root

3663696c48007d80a574976fc6fc97a6756c0bccbe1b217516d205dbf2eab616
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.

5.276 × 10⁹⁵(96-digit number)
52769265516884496647…27999169610149251201
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
5.276 × 10⁹⁵(96-digit number)
52769265516884496647…27999169610149251201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.055 × 10⁹⁶(97-digit number)
10553853103376899329…55998339220298502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.110 × 10⁹⁶(97-digit number)
21107706206753798659…11996678440597004801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.221 × 10⁹⁶(97-digit number)
42215412413507597318…23993356881194009601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.443 × 10⁹⁶(97-digit number)
84430824827015194636…47986713762388019201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.688 × 10⁹⁷(98-digit number)
16886164965403038927…95973427524776038401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.377 × 10⁹⁷(98-digit number)
33772329930806077854…91946855049552076801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.754 × 10⁹⁷(98-digit number)
67544659861612155708…83893710099104153601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.350 × 10⁹⁸(99-digit number)
13508931972322431141…67787420198208307201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.701 × 10⁹⁸(99-digit number)
27017863944644862283…35574840396416614401
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,911,188 XPM·at block #6,833,373 · 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