Block #856,224

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2014, 10:22:18 PM · Difficulty 10.9681 · 5,970,708 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ee7174c7ef6e62da7b0b243415af74b21715f5546ae56b8bf5788e2703578c84

Height

#856,224

Difficulty

10.968136

Transactions

14

Size

3.29 KB

Version

2

Bits

0af7d7bd

Nonce

1,047,015,003

Timestamp

12/16/2014, 10:22:18 PM

Confirmations

5,970,708

Merkle Root

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

1.037 × 10⁹⁹(100-digit number)
10375292025818409379…71239871595634152959
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
1.037 × 10⁹⁹(100-digit number)
10375292025818409379…71239871595634152959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.075 × 10⁹⁹(100-digit number)
20750584051636818759…42479743191268305919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.150 × 10⁹⁹(100-digit number)
41501168103273637518…84959486382536611839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.300 × 10⁹⁹(100-digit number)
83002336206547275037…69918972765073223679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.660 × 10¹⁰⁰(101-digit number)
16600467241309455007…39837945530146447359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.320 × 10¹⁰⁰(101-digit number)
33200934482618910014…79675891060292894719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.640 × 10¹⁰⁰(101-digit number)
66401868965237820029…59351782120585789439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.328 × 10¹⁰¹(102-digit number)
13280373793047564005…18703564241171578879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.656 × 10¹⁰¹(102-digit number)
26560747586095128011…37407128482343157759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.312 × 10¹⁰¹(102-digit number)
53121495172190256023…74814256964686315519
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,859,628 XPM·at block #6,826,931 · 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