Block #849,833

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2014, 2:21:49 AM · Difficulty 10.9714 · 5,992,494 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
28a4f4d21638b930216df3040bb10c3bfc30ae8c80eff507d55a3cbdd1ab0629

Height

#849,833

Difficulty

10.971368

Transactions

13

Size

4.71 KB

Version

2

Bits

0af8ab8f

Nonce

203,830,982

Timestamp

12/12/2014, 2:21:49 AM

Confirmations

5,992,494

Merkle Root

dd8a2a2dbc5c5f0a33bf82ac6a858427045e49abd97498371cc2d15fe450e7cf
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.322 × 10⁹⁹(100-digit number)
93224132936664545108…45830665570589818879
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.322 × 10⁹⁹(100-digit number)
93224132936664545108…45830665570589818879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.864 × 10¹⁰⁰(101-digit number)
18644826587332909021…91661331141179637759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.728 × 10¹⁰⁰(101-digit number)
37289653174665818043…83322662282359275519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.457 × 10¹⁰⁰(101-digit number)
74579306349331636086…66645324564718551039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.491 × 10¹⁰¹(102-digit number)
14915861269866327217…33290649129437102079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.983 × 10¹⁰¹(102-digit number)
29831722539732654434…66581298258874204159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.966 × 10¹⁰¹(102-digit number)
59663445079465308869…33162596517748408319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.193 × 10¹⁰²(103-digit number)
11932689015893061773…66325193035496816639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.386 × 10¹⁰²(103-digit number)
23865378031786123547…32650386070993633279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.773 × 10¹⁰²(103-digit number)
47730756063572247095…65300772141987266559
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,983,023 XPM·at block #6,842,326 · 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