Block #878,824

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/2/2015, 5:21:41 AM · Difficulty 10.9629 · 5,938,664 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0bb494eefc8438b1223ccb64647183460e5a70c0e312c7a4339dd4271b17f47a

Height

#878,824

Difficulty

10.962929

Transactions

4

Size

1.15 KB

Version

2

Bits

0af68285

Nonce

1,904,020,630

Timestamp

1/2/2015, 5:21:41 AM

Confirmations

5,938,664

Merkle Root

8738406b7e49b64e770171807e94b68a3e9855c17ee2cf0f2cebb135cd1c4238
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.253 × 10⁹⁶(97-digit number)
12535557966464427637…81706711848054137581
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.253 × 10⁹⁶(97-digit number)
12535557966464427637…81706711848054137581
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.507 × 10⁹⁶(97-digit number)
25071115932928855275…63413423696108275161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.014 × 10⁹⁶(97-digit number)
50142231865857710551…26826847392216550321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.002 × 10⁹⁷(98-digit number)
10028446373171542110…53653694784433100641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.005 × 10⁹⁷(98-digit number)
20056892746343084220…07307389568866201281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.011 × 10⁹⁷(98-digit number)
40113785492686168441…14614779137732402561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.022 × 10⁹⁷(98-digit number)
80227570985372336882…29229558275464805121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.604 × 10⁹⁸(99-digit number)
16045514197074467376…58459116550929610241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.209 × 10⁹⁸(99-digit number)
32091028394148934752…16918233101859220481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.418 × 10⁹⁸(99-digit number)
64182056788297869505…33836466203718440961
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,783,959 XPM·at block #6,817,487 · 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