Block #924,165

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/5/2015, 7:39:24 PM · Difficulty 10.9122 · 5,902,161 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
22a922d1f3f269a5c83bc0314385f0adbbb5f7659d1eb577e96bbd3123cd79dc

Height

#924,165

Difficulty

10.912188

Transactions

9

Size

1.97 KB

Version

2

Bits

0ae98527

Nonce

1,915,096,667

Timestamp

2/5/2015, 7:39:24 PM

Confirmations

5,902,161

Merkle Root

4721bce616c88b11083ffa921e66f88df0dde9010fdc8411c2a793b5a9aea3cf
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.882 × 10⁹⁶(97-digit number)
58826935553032322033…62499697314938147199
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.882 × 10⁹⁶(97-digit number)
58826935553032322033…62499697314938147199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.176 × 10⁹⁷(98-digit number)
11765387110606464406…24999394629876294399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.353 × 10⁹⁷(98-digit number)
23530774221212928813…49998789259752588799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.706 × 10⁹⁷(98-digit number)
47061548442425857626…99997578519505177599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.412 × 10⁹⁷(98-digit number)
94123096884851715253…99995157039010355199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.882 × 10⁹⁸(99-digit number)
18824619376970343050…99990314078020710399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.764 × 10⁹⁸(99-digit number)
37649238753940686101…99980628156041420799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.529 × 10⁹⁸(99-digit number)
75298477507881372202…99961256312082841599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.505 × 10⁹⁹(100-digit number)
15059695501576274440…99922512624165683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.011 × 10⁹⁹(100-digit number)
30119391003152548881…99845025248331366399
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,854,748 XPM·at block #6,826,325 · 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