Block #856,608

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2014, 5:07:39 AM · Difficulty 10.9680 · 5,970,546 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4e9bac876c76c010f073567d547d4cab2bbafdf297fdbba672cfa1d2b77c27c1

Height

#856,608

Difficulty

10.968017

Transactions

11

Size

5.44 KB

Version

2

Bits

0af7cff0

Nonce

338,072,498

Timestamp

12/17/2014, 5:07:39 AM

Confirmations

5,970,546

Merkle Root

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

6.769 × 10⁹⁶(97-digit number)
67693379397528167187…19236056181307903999
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
6.769 × 10⁹⁶(97-digit number)
67693379397528167187…19236056181307903999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.353 × 10⁹⁷(98-digit number)
13538675879505633437…38472112362615807999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.707 × 10⁹⁷(98-digit number)
27077351759011266875…76944224725231615999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.415 × 10⁹⁷(98-digit number)
54154703518022533750…53888449450463231999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.083 × 10⁹⁸(99-digit number)
10830940703604506750…07776898900926463999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.166 × 10⁹⁸(99-digit number)
21661881407209013500…15553797801852927999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.332 × 10⁹⁸(99-digit number)
43323762814418027000…31107595603705855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.664 × 10⁹⁸(99-digit number)
86647525628836054000…62215191207411711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.732 × 10⁹⁹(100-digit number)
17329505125767210800…24430382414823423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.465 × 10⁹⁹(100-digit number)
34659010251534421600…48860764829646847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.931 × 10⁹⁹(100-digit number)
69318020503068843200…97721529659293695999
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,861,416 XPM·at block #6,827,153 · 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