Block #846,607

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/9/2014, 5:36:08 PM · Difficulty 10.9723 · 5,985,173 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5cca2bbdebdbc676580f31ce0bc8db8fcac3c749c0b58a70b40dc2e67266b6a4

Height

#846,607

Difficulty

10.972264

Transactions

5

Size

1.08 KB

Version

2

Bits

0af8e649

Nonce

1,472,945,194

Timestamp

12/9/2014, 5:36:08 PM

Confirmations

5,985,173

Merkle Root

8c25c87e58def635d77daee7ccea38a0e4f6570ee1cb714bcce8d8d92d0ec590
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.

5.078 × 10⁹⁷(98-digit number)
50788548499849604778…28100875495958174719
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
5.078 × 10⁹⁷(98-digit number)
50788548499849604778…28100875495958174719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.015 × 10⁹⁸(99-digit number)
10157709699969920955…56201750991916349439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.031 × 10⁹⁸(99-digit number)
20315419399939841911…12403501983832698879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.063 × 10⁹⁸(99-digit number)
40630838799879683822…24807003967665397759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.126 × 10⁹⁸(99-digit number)
81261677599759367644…49614007935330795519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.625 × 10⁹⁹(100-digit number)
16252335519951873528…99228015870661591039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.250 × 10⁹⁹(100-digit number)
32504671039903747057…98456031741323182079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.500 × 10⁹⁹(100-digit number)
65009342079807494115…96912063482646364159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.300 × 10¹⁰⁰(101-digit number)
13001868415961498823…93824126965292728319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.600 × 10¹⁰⁰(101-digit number)
26003736831922997646…87648253930585456639
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,898,352 XPM·at block #6,831,779 · 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