Block #851,451

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2014, 7:34:31 AM · Difficulty 10.9706 · 5,956,666 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a8ba6442ddec3ff6c219d074ae68801bd26ad0e70def13509453645fdf666748

Height

#851,451

Difficulty

10.970633

Transactions

6

Size

1.44 KB

Version

2

Bits

0af87b63

Nonce

200,817,158

Timestamp

12/13/2014, 7:34:31 AM

Confirmations

5,956,666

Merkle Root

385a0d196d017264b7f139be8272099e14f85aab2b25ff9142797c7e6c7ae755
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.

8.207 × 10⁹⁴(95-digit number)
82077406239052039796…51358069716348941441
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
8.207 × 10⁹⁴(95-digit number)
82077406239052039796…51358069716348941441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.641 × 10⁹⁵(96-digit number)
16415481247810407959…02716139432697882881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.283 × 10⁹⁵(96-digit number)
32830962495620815918…05432278865395765761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.566 × 10⁹⁵(96-digit number)
65661924991241631837…10864557730791531521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.313 × 10⁹⁶(97-digit number)
13132384998248326367…21729115461583063041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.626 × 10⁹⁶(97-digit number)
26264769996496652734…43458230923166126081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.252 × 10⁹⁶(97-digit number)
52529539992993305469…86916461846332252161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.050 × 10⁹⁷(98-digit number)
10505907998598661093…73832923692664504321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.101 × 10⁹⁷(98-digit number)
21011815997197322187…47665847385329008641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.202 × 10⁹⁷(98-digit number)
42023631994394644375…95331694770658017281
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,708,977 XPM·at block #6,808,116 · 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.

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