Block #843,004

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/7/2014, 2:04:26 AM · Difficulty 10.9733 · 5,999,208 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f98b755e2e8a8b9c4c98920853260afe30f9749600412181e7135d099a197ff8

Height

#843,004

Difficulty

10.973278

Transactions

6

Size

1.31 KB

Version

2

Bits

0af928c4

Nonce

143,211,225

Timestamp

12/7/2014, 2:04:26 AM

Confirmations

5,999,208

Merkle Root

f8e20aedbd0f379f558de6a87a7cd5ae74a8c8ff7509f25648d89dcb89b5b483
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.085 × 10⁹⁵(96-digit number)
20856941427044312099…02987568630680685279
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.085 × 10⁹⁵(96-digit number)
20856941427044312099…02987568630680685279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.171 × 10⁹⁵(96-digit number)
41713882854088624198…05975137261361370559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.342 × 10⁹⁵(96-digit number)
83427765708177248396…11950274522722741119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.668 × 10⁹⁶(97-digit number)
16685553141635449679…23900549045445482239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.337 × 10⁹⁶(97-digit number)
33371106283270899358…47801098090890964479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.674 × 10⁹⁶(97-digit number)
66742212566541798716…95602196181781928959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.334 × 10⁹⁷(98-digit number)
13348442513308359743…91204392363563857919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.669 × 10⁹⁷(98-digit number)
26696885026616719486…82408784727127715839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.339 × 10⁹⁷(98-digit number)
53393770053233438973…64817569454255431679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.067 × 10⁹⁸(99-digit number)
10678754010646687794…29635138908510863359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.135 × 10⁹⁸(99-digit number)
21357508021293375589…59270277817021726719
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,982,093 XPM·at block #6,842,211 · 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