Block #851,874

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2014, 3:23:18 PM · Difficulty 10.9704 · 5,982,052 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
de05bd6c1b5430a6e740c736b622f3101421335b0cc4b96aa163fad17fb2569f

Height

#851,874

Difficulty

10.970385

Transactions

3

Size

726 B

Version

2

Bits

0af86b25

Nonce

18,281,552

Timestamp

12/13/2014, 3:23:18 PM

Confirmations

5,982,052

Merkle Root

73bcff398524f28ed79aec36f68d8dab138c364353b52ad3b638a711cf7ac93b
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.

3.084 × 10⁹⁷(98-digit number)
30841424918116428388…02035820634202337281
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
3.084 × 10⁹⁷(98-digit number)
30841424918116428388…02035820634202337281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.168 × 10⁹⁷(98-digit number)
61682849836232856777…04071641268404674561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.233 × 10⁹⁸(99-digit number)
12336569967246571355…08143282536809349121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.467 × 10⁹⁸(99-digit number)
24673139934493142711…16286565073618698241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.934 × 10⁹⁸(99-digit number)
49346279868986285422…32573130147237396481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.869 × 10⁹⁸(99-digit number)
98692559737972570844…65146260294474792961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.973 × 10⁹⁹(100-digit number)
19738511947594514168…30292520588949585921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.947 × 10⁹⁹(100-digit number)
39477023895189028337…60585041177899171841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.895 × 10⁹⁹(100-digit number)
78954047790378056675…21170082355798343681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.579 × 10¹⁰⁰(101-digit number)
15790809558075611335…42340164711596687361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.158 × 10¹⁰⁰(101-digit number)
31581619116151222670…84680329423193374721
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