Block #843,437

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/7/2014, 9:36:38 AM · Difficulty 10.9732 · 5,994,702 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b69c316cc0471c190fa887c9e7143feac3971a178cca3632819f438598d77130

Height

#843,437

Difficulty

10.973197

Transactions

15

Size

4.30 KB

Version

2

Bits

0af9236b

Nonce

133,474,684

Timestamp

12/7/2014, 9:36:38 AM

Confirmations

5,994,702

Merkle Root

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

2.612 × 10⁹⁵(96-digit number)
26126724993754311006…03596110793696124399
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
2.612 × 10⁹⁵(96-digit number)
26126724993754311006…03596110793696124399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.225 × 10⁹⁵(96-digit number)
52253449987508622013…07192221587392248799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.045 × 10⁹⁶(97-digit number)
10450689997501724402…14384443174784497599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.090 × 10⁹⁶(97-digit number)
20901379995003448805…28768886349568995199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.180 × 10⁹⁶(97-digit number)
41802759990006897610…57537772699137990399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.360 × 10⁹⁶(97-digit number)
83605519980013795221…15075545398275980799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.672 × 10⁹⁷(98-digit number)
16721103996002759044…30151090796551961599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.344 × 10⁹⁷(98-digit number)
33442207992005518088…60302181593103923199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.688 × 10⁹⁷(98-digit number)
66884415984011036177…20604363186207846399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.337 × 10⁹⁸(99-digit number)
13376883196802207235…41208726372415692799
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,949,380 XPM·at block #6,838,138 · 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