Block #843,616

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/7/2014, 12:48:10 PM · Difficulty 10.9731 · 5,997,649 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e920604e70a9aec8e527d3c17669c70c6a3a8ce1565fc07ed8869782e0603187

Height

#843,616

Difficulty

10.973129

Transactions

3

Size

626 B

Version

2

Bits

0af91efc

Nonce

389,794,093

Timestamp

12/7/2014, 12:48:10 PM

Confirmations

5,997,649

Merkle Root

7bc3d028a8c5869420ad33f177a4fc747bef6c83ad18e2f7ecd7de7286178a26
Transactions (3)
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.

4.842 × 10⁹⁶(97-digit number)
48420479907348750782…18427930966606079999
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
4.842 × 10⁹⁶(97-digit number)
48420479907348750782…18427930966606079999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.684 × 10⁹⁶(97-digit number)
96840959814697501564…36855861933212159999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.936 × 10⁹⁷(98-digit number)
19368191962939500312…73711723866424319999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.873 × 10⁹⁷(98-digit number)
38736383925879000625…47423447732848639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.747 × 10⁹⁷(98-digit number)
77472767851758001251…94846895465697279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.549 × 10⁹⁸(99-digit number)
15494553570351600250…89693790931394559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.098 × 10⁹⁸(99-digit number)
30989107140703200500…79387581862789119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.197 × 10⁹⁸(99-digit number)
61978214281406401001…58775163725578239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.239 × 10⁹⁹(100-digit number)
12395642856281280200…17550327451156479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.479 × 10⁹⁹(100-digit number)
24791285712562560400…35100654902312959999
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,974,485 XPM·at block #6,841,264 · 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