Block #842,989

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2014, 1:42:07 AM · Difficulty 10.9733 · 5,990,187 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4e84b1d25f730478175a3531bbe09b808407b66a690eaad1a102a561c2ce2cff

Height

#842,989

Difficulty

10.973324

Transactions

12

Size

3.38 KB

Version

2

Bits

0af92bbc

Nonce

2,646,342,297

Timestamp

12/7/2014, 1:42:07 AM

Confirmations

5,990,187

Merkle Root

f95ad141bea98710c3b1c21f25142cbecc9f13bc96496839d8e2b6510ede9fce
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.516 × 10⁹⁸(99-digit number)
25160638037998854579…21635009233979120641
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.516 × 10⁹⁸(99-digit number)
25160638037998854579…21635009233979120641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.032 × 10⁹⁸(99-digit number)
50321276075997709159…43270018467958241281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.006 × 10⁹⁹(100-digit number)
10064255215199541831…86540036935916482561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.012 × 10⁹⁹(100-digit number)
20128510430399083663…73080073871832965121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.025 × 10⁹⁹(100-digit number)
40257020860798167327…46160147743665930241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.051 × 10⁹⁹(100-digit number)
80514041721596334655…92320295487331860481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.610 × 10¹⁰⁰(101-digit number)
16102808344319266931…84640590974663720961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.220 × 10¹⁰⁰(101-digit number)
32205616688638533862…69281181949327441921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.441 × 10¹⁰⁰(101-digit number)
64411233377277067724…38562363898654883841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.288 × 10¹⁰¹(102-digit number)
12882246675455413544…77124727797309767681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.576 × 10¹⁰¹(102-digit number)
25764493350910827089…54249455594619535361
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,909,590 XPM·at block #6,833,175 · 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