Block #855,745

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2014, 2:04:03 PM · Difficulty 10.9682 · 5,988,329 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
539d42d5ad7188b7d2494e8c889d087f1ca62851cfdceecbb66fb9bf4e6b03d6

Height

#855,745

Difficulty

10.968243

Transactions

23

Size

4.87 KB

Version

2

Bits

0af7dece

Nonce

2,068,901,570

Timestamp

12/16/2014, 2:04:03 PM

Confirmations

5,988,329

Merkle Root

63f2a368dec51886fd6efa3b9bfec10c17cebbcd627f0351c440d64e53068b46
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.

2.949 × 10⁹⁵(96-digit number)
29493719096928965751…29925182548392865761
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
2.949 × 10⁹⁵(96-digit number)
29493719096928965751…29925182548392865761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.898 × 10⁹⁵(96-digit number)
58987438193857931503…59850365096785731521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.179 × 10⁹⁶(97-digit number)
11797487638771586300…19700730193571463041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.359 × 10⁹⁶(97-digit number)
23594975277543172601…39401460387142926081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.718 × 10⁹⁶(97-digit number)
47189950555086345203…78802920774285852161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.437 × 10⁹⁶(97-digit number)
94379901110172690406…57605841548571704321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.887 × 10⁹⁷(98-digit number)
18875980222034538081…15211683097143408641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.775 × 10⁹⁷(98-digit number)
37751960444069076162…30423366194286817281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.550 × 10⁹⁷(98-digit number)
75503920888138152325…60846732388573634561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.510 × 10⁹⁸(99-digit number)
15100784177627630465…21693464777147269121
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,996,967 XPM·at block #6,844,073 · 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