Block #855,050

2CCLength 11★★★☆☆

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

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3ad13a7d0516a93518742b3241be6564c0ca8c474c6c84b8cddd7a96d2bfc1da

Height

#855,050

Difficulty

10.968500

Transactions

6

Size

1.44 KB

Version

2

Bits

0af7ef9d

Nonce

2,084,996,234

Timestamp

12/16/2014, 1:45:16 AM

Confirmations

5,978,876

Merkle Root

dccfe0543de5a640b184f5c22cf08b7c33721f97447349e8bcb6a446f837e542
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.563 × 10⁹⁶(97-digit number)
15637123362336095790…54174053112926453761
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.563 × 10⁹⁶(97-digit number)
15637123362336095790…54174053112926453761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.127 × 10⁹⁶(97-digit number)
31274246724672191580…08348106225852907521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.254 × 10⁹⁶(97-digit number)
62548493449344383160…16696212451705815041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.250 × 10⁹⁷(98-digit number)
12509698689868876632…33392424903411630081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.501 × 10⁹⁷(98-digit number)
25019397379737753264…66784849806823260161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.003 × 10⁹⁷(98-digit number)
50038794759475506528…33569699613646520321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.000 × 10⁹⁸(99-digit number)
10007758951895101305…67139399227293040641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.001 × 10⁹⁸(99-digit number)
20015517903790202611…34278798454586081281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.003 × 10⁹⁸(99-digit number)
40031035807580405222…68557596909172162561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.006 × 10⁹⁸(99-digit number)
80062071615160810445…37115193818344325121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.601 × 10⁹⁹(100-digit number)
16012414323032162089…74230387636688650241
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,915,636 XPM·at block #6,833,925 · 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