Block #851,029

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2014, 12:02:22 AM · Difficulty 10.9708 · 5,991,998 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0999038d96cd8523dfc177aa1e790e2e5a3aabf1a993e9e274eb8b527f73a9d5

Height

#851,029

Difficulty

10.970792

Transactions

8

Size

2.06 KB

Version

2

Bits

0af885cd

Nonce

44,879,424

Timestamp

12/13/2014, 12:02:22 AM

Confirmations

5,991,998

Merkle Root

3d5aba47dd4be7cd728a31d55cedd8a74bbcdd4a06b21b3bc04bda90d97278e7
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.474 × 10⁹⁶(97-digit number)
14740965023173820540…88572501297064499201
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.474 × 10⁹⁶(97-digit number)
14740965023173820540…88572501297064499201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.948 × 10⁹⁶(97-digit number)
29481930046347641080…77145002594128998401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.896 × 10⁹⁶(97-digit number)
58963860092695282160…54290005188257996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.179 × 10⁹⁷(98-digit number)
11792772018539056432…08580010376515993601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.358 × 10⁹⁷(98-digit number)
23585544037078112864…17160020753031987201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.717 × 10⁹⁷(98-digit number)
47171088074156225728…34320041506063974401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.434 × 10⁹⁷(98-digit number)
94342176148312451456…68640083012127948801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.886 × 10⁹⁸(99-digit number)
18868435229662490291…37280166024255897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.773 × 10⁹⁸(99-digit number)
37736870459324980582…74560332048511795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.547 × 10⁹⁸(99-digit number)
75473740918649961165…49120664097023590401
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,988,570 XPM·at block #6,843,026 · 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