Block #844,723

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2014, 8:07:21 AM · Difficulty 10.9729 · 5,997,632 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6bb5577b5008fd37a1f4996d67d30284b7da0b53161ebb8562b1708b8910ea61

Height

#844,723

Difficulty

10.972893

Transactions

5

Size

1.08 KB

Version

2

Bits

0af90f7c

Nonce

95,208,216

Timestamp

12/8/2014, 8:07:21 AM

Confirmations

5,997,632

Merkle Root

7edbac187d76d3288f60e65741cee85d8551fcf31fc3896a4357cc72dab3f764
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.598 × 10⁹⁸(99-digit number)
15980589418860369803…80863592158871552001
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.598 × 10⁹⁸(99-digit number)
15980589418860369803…80863592158871552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.196 × 10⁹⁸(99-digit number)
31961178837720739607…61727184317743104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.392 × 10⁹⁸(99-digit number)
63922357675441479215…23454368635486208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.278 × 10⁹⁹(100-digit number)
12784471535088295843…46908737270972416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.556 × 10⁹⁹(100-digit number)
25568943070176591686…93817474541944832001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.113 × 10⁹⁹(100-digit number)
51137886140353183372…87634949083889664001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.022 × 10¹⁰⁰(101-digit number)
10227577228070636674…75269898167779328001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.045 × 10¹⁰⁰(101-digit number)
20455154456141273348…50539796335558656001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.091 × 10¹⁰⁰(101-digit number)
40910308912282546697…01079592671117312001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.182 × 10¹⁰⁰(101-digit number)
81820617824565093395…02159185342234624001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.636 × 10¹⁰¹(102-digit number)
16364123564913018679…04318370684469248001
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,983,247 XPM·at block #6,842,354 · 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