Block #846,143

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2014, 9:41:42 AM · Difficulty 10.9723 · 5,995,568 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
77a6758a2e49ac155bc7c4a9d59f2a098e6ba529926766e1626a7cc1181d5268

Height

#846,143

Difficulty

10.972317

Transactions

13

Size

4.91 KB

Version

2

Bits

0af8e9c5

Nonce

1,615,869,943

Timestamp

12/9/2014, 9:41:42 AM

Confirmations

5,995,568

Merkle Root

78975d9f960095c4f52ba5c1382f4e44f99f726c74d067393dc01db6ce2ec757
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.

6.723 × 10⁹⁵(96-digit number)
67234534296216793490…34887890781290336641
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
6.723 × 10⁹⁵(96-digit number)
67234534296216793490…34887890781290336641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.344 × 10⁹⁶(97-digit number)
13446906859243358698…69775781562580673281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.689 × 10⁹⁶(97-digit number)
26893813718486717396…39551563125161346561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.378 × 10⁹⁶(97-digit number)
53787627436973434792…79103126250322693121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.075 × 10⁹⁷(98-digit number)
10757525487394686958…58206252500645386241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.151 × 10⁹⁷(98-digit number)
21515050974789373916…16412505001290772481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.303 × 10⁹⁷(98-digit number)
43030101949578747833…32825010002581544961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.606 × 10⁹⁷(98-digit number)
86060203899157495667…65650020005163089921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.721 × 10⁹⁸(99-digit number)
17212040779831499133…31300040010326179841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.442 × 10⁹⁸(99-digit number)
34424081559662998267…62600080020652359681
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,978,067 XPM·at block #6,841,710 · 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