Block #846,690

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/9/2014, 7:15:33 PM · Difficulty 10.9722 · 5,989,904 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4d78feb8a4aff0565a0a69ccf56d80f196015894fafa8d25fd408242e6741aa7

Height

#846,690

Difficulty

10.972173

Transactions

7

Size

1.52 KB

Version

2

Bits

0af8e05a

Nonce

1,935,336,828

Timestamp

12/9/2014, 7:15:33 PM

Confirmations

5,989,904

Merkle Root

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

9.161 × 10⁹⁵(96-digit number)
91617066343665830431…14681238753801087999
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
9.161 × 10⁹⁵(96-digit number)
91617066343665830431…14681238753801087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.832 × 10⁹⁶(97-digit number)
18323413268733166086…29362477507602175999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.664 × 10⁹⁶(97-digit number)
36646826537466332172…58724955015204351999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.329 × 10⁹⁶(97-digit number)
73293653074932664345…17449910030408703999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.465 × 10⁹⁷(98-digit number)
14658730614986532869…34899820060817407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.931 × 10⁹⁷(98-digit number)
29317461229973065738…69799640121634815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.863 × 10⁹⁷(98-digit number)
58634922459946131476…39599280243269631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.172 × 10⁹⁸(99-digit number)
11726984491989226295…79198560486539263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.345 × 10⁹⁸(99-digit number)
23453968983978452590…58397120973078527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.690 × 10⁹⁸(99-digit number)
46907937967956905180…16794241946157055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.381 × 10⁹⁸(99-digit number)
93815875935913810361…33588483892314111999
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,937,022 XPM·at block #6,836,593 · 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