Block #844,981

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2014, 1:10:46 PM · Difficulty 10.9727 · 5,999,526 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a9aa748ac88eff42f1b3f22b73389dd63dd7017ea448f446b034aacc74e969d1

Height

#844,981

Difficulty

10.972654

Transactions

8

Size

1.79 KB

Version

2

Bits

0af8ffda

Nonce

355,135,921

Timestamp

12/8/2014, 1:10:46 PM

Confirmations

5,999,526

Merkle Root

7a876967584e5b6d4243948f49bb84059b92e45b8df22c1a6b5c2ce34f5f6aab
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.

2.695 × 10⁹⁵(96-digit number)
26956212528994752284…24166929492237594681
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
2.695 × 10⁹⁵(96-digit number)
26956212528994752284…24166929492237594681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.391 × 10⁹⁵(96-digit number)
53912425057989504569…48333858984475189361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.078 × 10⁹⁶(97-digit number)
10782485011597900913…96667717968950378721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.156 × 10⁹⁶(97-digit number)
21564970023195801827…93335435937900757441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.312 × 10⁹⁶(97-digit number)
43129940046391603655…86670871875801514881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.625 × 10⁹⁶(97-digit number)
86259880092783207311…73341743751603029761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.725 × 10⁹⁷(98-digit number)
17251976018556641462…46683487503206059521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.450 × 10⁹⁷(98-digit number)
34503952037113282924…93366975006412119041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.900 × 10⁹⁷(98-digit number)
69007904074226565849…86733950012824238081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.380 × 10⁹⁸(99-digit number)
13801580814845313169…73467900025648476161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.760 × 10⁹⁸(99-digit number)
27603161629690626339…46935800051296952321
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:58,000,454 XPM·at block #6,844,506 · 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