Block #844,764

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2014, 9:05:54 AM · Difficulty 10.9728 · 5,997,196 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1a3e466dc10aa787d2ae4280c34f0f4fc3892e4145c1f5607d58dc5aa5580cbe

Height

#844,764

Difficulty

10.972796

Transactions

17

Size

3.92 KB

Version

2

Bits

0af90925

Nonce

1,955,957,529

Timestamp

12/8/2014, 9:05:54 AM

Confirmations

5,997,196

Merkle Root

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

4.505 × 10⁹⁷(98-digit number)
45053853752249253481…14328712980044807681
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
4.505 × 10⁹⁷(98-digit number)
45053853752249253481…14328712980044807681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.010 × 10⁹⁷(98-digit number)
90107707504498506963…28657425960089615361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.802 × 10⁹⁸(99-digit number)
18021541500899701392…57314851920179230721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.604 × 10⁹⁸(99-digit number)
36043083001799402785…14629703840358461441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.208 × 10⁹⁸(99-digit number)
72086166003598805570…29259407680716922881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.441 × 10⁹⁹(100-digit number)
14417233200719761114…58518815361433845761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.883 × 10⁹⁹(100-digit number)
28834466401439522228…17037630722867691521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.766 × 10⁹⁹(100-digit number)
57668932802879044456…34075261445735383041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.153 × 10¹⁰⁰(101-digit number)
11533786560575808891…68150522891470766081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.306 × 10¹⁰⁰(101-digit number)
23067573121151617782…36301045782941532161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.613 × 10¹⁰⁰(101-digit number)
46135146242303235565…72602091565883064321
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,980,061 XPM·at block #6,841,959 · 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