Block #850,724

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2014, 5:47:50 PM · Difficulty 10.9712 · 5,994,621 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eee53cc793e9e2d466af4a98dc66a70034b801c9cddb3e177b8965f68d782cbc

Height

#850,724

Difficulty

10.971183

Transactions

5

Size

1.09 KB

Version

2

Bits

0af89f6c

Nonce

240,529,734

Timestamp

12/12/2014, 5:47:50 PM

Confirmations

5,994,621

Merkle Root

d176da34636e32f73035f745cc6a062f6202c082c17d0e5211627826bee8cf25
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.598 × 10⁹⁴(95-digit number)
65985489860231262493…95496790120876105599
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.598 × 10⁹⁴(95-digit number)
65985489860231262493…95496790120876105599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.319 × 10⁹⁵(96-digit number)
13197097972046252498…90993580241752211199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.639 × 10⁹⁵(96-digit number)
26394195944092504997…81987160483504422399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.278 × 10⁹⁵(96-digit number)
52788391888185009995…63974320967008844799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.055 × 10⁹⁶(97-digit number)
10557678377637001999…27948641934017689599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.111 × 10⁹⁶(97-digit number)
21115356755274003998…55897283868035379199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.223 × 10⁹⁶(97-digit number)
42230713510548007996…11794567736070758399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.446 × 10⁹⁶(97-digit number)
84461427021096015992…23589135472141516799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.689 × 10⁹⁷(98-digit number)
16892285404219203198…47178270944283033599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.378 × 10⁹⁷(98-digit number)
33784570808438406396…94356541888566067199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.756 × 10⁹⁷(98-digit number)
67569141616876812793…88713083777132134399
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:58,007,201 XPM·at block #6,845,344 · 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