Block #856,177

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2014, 9:28:59 PM · Difficulty 10.9682 · 5,980,887 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b98b1dc861a0700f8bc7b316f6884ed35d5dec665e10d6a9e25961367ae59bc7

Height

#856,177

Difficulty

10.968175

Transactions

3

Size

807 B

Version

2

Bits

0af7da4c

Nonce

1,814,647,450

Timestamp

12/16/2014, 9:28:59 PM

Confirmations

5,980,887

Merkle Root

b39aeeb66a696541bc4d3fe6940b12f7952ee788c70324c2a00b94eae43d67bf
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.313 × 10⁹⁸(99-digit number)
13139156034823448309…97456829133296896001
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.313 × 10⁹⁸(99-digit number)
13139156034823448309…97456829133296896001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.627 × 10⁹⁸(99-digit number)
26278312069646896619…94913658266593792001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.255 × 10⁹⁸(99-digit number)
52556624139293793239…89827316533187584001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.051 × 10⁹⁹(100-digit number)
10511324827858758647…79654633066375168001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.102 × 10⁹⁹(100-digit number)
21022649655717517295…59309266132750336001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.204 × 10⁹⁹(100-digit number)
42045299311435034591…18618532265500672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.409 × 10⁹⁹(100-digit number)
84090598622870069182…37237064531001344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.681 × 10¹⁰⁰(101-digit number)
16818119724574013836…74474129062002688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.363 × 10¹⁰⁰(101-digit number)
33636239449148027672…48948258124005376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.727 × 10¹⁰⁰(101-digit number)
67272478898296055345…97896516248010752001
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,940,815 XPM·at block #6,837,063 · 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