Block #849,026

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2014, 12:57:53 PM · Difficulty 10.9713 · 5,990,035 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b76e64bb61ba5247d523f34c7e820c585e0d7a37c2deebb14d16657998caa5e0

Height

#849,026

Difficulty

10.971309

Transactions

2

Size

434 B

Version

2

Bits

0af8a7af

Nonce

665,871,460

Timestamp

12/11/2014, 12:57:53 PM

Confirmations

5,990,035

Merkle Root

b4c1b59f6b5a4592d2c25b7b9d4afa8d01bb448b122192d8147b174f1b6efa37
Transactions (2)
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.

7.344 × 10⁹⁷(98-digit number)
73448440829696162544…42321866003259171841
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
7.344 × 10⁹⁷(98-digit number)
73448440829696162544…42321866003259171841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.468 × 10⁹⁸(99-digit number)
14689688165939232508…84643732006518343681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.937 × 10⁹⁸(99-digit number)
29379376331878465017…69287464013036687361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.875 × 10⁹⁸(99-digit number)
58758752663756930035…38574928026073374721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.175 × 10⁹⁹(100-digit number)
11751750532751386007…77149856052146749441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.350 × 10⁹⁹(100-digit number)
23503501065502772014…54299712104293498881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.700 × 10⁹⁹(100-digit number)
47007002131005544028…08599424208586997761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.401 × 10⁹⁹(100-digit number)
94014004262011088057…17198848417173995521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.880 × 10¹⁰⁰(101-digit number)
18802800852402217611…34397696834347991041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.760 × 10¹⁰⁰(101-digit number)
37605601704804435223…68795393668695982081
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,956,756 XPM·at block #6,839,060 · 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