Block #842,224

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/6/2014, 11:25:07 AM · Difficulty 10.9738 · 5,988,630 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e33933a1151fb22d1392fa83e17db0cb95526f5cb1686c47b287978fe9b7a1f3

Height

#842,224

Difficulty

10.973779

Transactions

6

Size

1.30 KB

Version

2

Bits

0af9498f

Nonce

1,212,232,592

Timestamp

12/6/2014, 11:25:07 AM

Confirmations

5,988,630

Merkle Root

5d9abe8ea0f8d009ef136e97caa9b6333a943ea427d869126fd33fa628301f9b
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.163 × 10⁹⁴(95-digit number)
11638680968248937022…92511828558876847441
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.163 × 10⁹⁴(95-digit number)
11638680968248937022…92511828558876847441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.327 × 10⁹⁴(95-digit number)
23277361936497874045…85023657117753694881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.655 × 10⁹⁴(95-digit number)
46554723872995748091…70047314235507389761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.310 × 10⁹⁴(95-digit number)
93109447745991496182…40094628471014779521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.862 × 10⁹⁵(96-digit number)
18621889549198299236…80189256942029559041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.724 × 10⁹⁵(96-digit number)
37243779098396598472…60378513884059118081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.448 × 10⁹⁵(96-digit number)
74487558196793196945…20757027768118236161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.489 × 10⁹⁶(97-digit number)
14897511639358639389…41514055536236472321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.979 × 10⁹⁶(97-digit number)
29795023278717278778…83028111072472944641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.959 × 10⁹⁶(97-digit number)
59590046557434557556…66056222144945889281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.191 × 10⁹⁷(98-digit number)
11918009311486911511…32112444289891778561
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,890,968 XPM·at block #6,830,853 · 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