Block #855,054

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2014, 1:52:54 AM · Difficulty 10.9685 · 5,978,343 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0799168f0b084796f34d1267613e4c0527b2e215ac9ddaeb91dfb466175f24c4

Height

#855,054

Difficulty

10.968500

Transactions

15

Size

6.04 KB

Version

2

Bits

0af7ef99

Nonce

1,591,225

Timestamp

12/16/2014, 1:52:54 AM

Confirmations

5,978,343

Merkle Root

e698bffb563f2537d926a08991a220e77d694bdd0b86780be23b2937f17f6aa8
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.320 × 10⁹⁵(96-digit number)
13200627168070920352…02485086891141678301
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.320 × 10⁹⁵(96-digit number)
13200627168070920352…02485086891141678301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.640 × 10⁹⁵(96-digit number)
26401254336141840704…04970173782283356601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.280 × 10⁹⁵(96-digit number)
52802508672283681409…09940347564566713201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.056 × 10⁹⁶(97-digit number)
10560501734456736281…19880695129133426401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.112 × 10⁹⁶(97-digit number)
21121003468913472563…39761390258266852801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.224 × 10⁹⁶(97-digit number)
42242006937826945127…79522780516533705601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.448 × 10⁹⁶(97-digit number)
84484013875653890255…59045561033067411201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.689 × 10⁹⁷(98-digit number)
16896802775130778051…18091122066134822401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.379 × 10⁹⁷(98-digit number)
33793605550261556102…36182244132269644801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.758 × 10⁹⁷(98-digit number)
67587211100523112204…72364488264539289601
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,376 XPM·at block #6,833,396 · 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