Block #857,832

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2014, 3:19:00 AM · Difficulty 10.9674 · 5,984,481 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e4bba60be8ed2db11b9d0cc9ed62c056ae9ffc7f27c0921735ddb2b66485a7af

Height

#857,832

Difficulty

10.967370

Transactions

12

Size

2.50 KB

Version

2

Bits

0af7a58b

Nonce

2,228,232,684

Timestamp

12/18/2014, 3:19:00 AM

Confirmations

5,984,481

Merkle Root

b740b134dad0bdd543e03fbf99735b9659f8b7502b4e3b21a95c9813c19d4229
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.587 × 10⁹⁶(97-digit number)
15877201969725976302…80477772485615640961
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.587 × 10⁹⁶(97-digit number)
15877201969725976302…80477772485615640961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.175 × 10⁹⁶(97-digit number)
31754403939451952604…60955544971231281921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.350 × 10⁹⁶(97-digit number)
63508807878903905209…21911089942462563841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.270 × 10⁹⁷(98-digit number)
12701761575780781041…43822179884925127681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.540 × 10⁹⁷(98-digit number)
25403523151561562083…87644359769850255361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.080 × 10⁹⁷(98-digit number)
50807046303123124167…75288719539700510721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.016 × 10⁹⁸(99-digit number)
10161409260624624833…50577439079401021441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.032 × 10⁹⁸(99-digit number)
20322818521249249667…01154878158802042881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.064 × 10⁹⁸(99-digit number)
40645637042498499334…02309756317604085761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.129 × 10⁹⁸(99-digit number)
81291274084996998668…04619512635208171521
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,982,911 XPM·at block #6,842,312 · 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