Block #398,723

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/10/2014, 10:44:20 PM · Difficulty 10.4229 · 6,417,426 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1db90952d2b59bb633ce9329d034b435185a80ccabd3b796f72d58950f11a9d5

Height

#398,723

Difficulty

10.422934

Transactions

2

Size

1.17 KB

Version

2

Bits

0a6c456c

Nonce

173,622

Timestamp

2/10/2014, 10:44:20 PM

Confirmations

6,417,426

Merkle Root

ef5458b489159675d1e1c1c6a681749a951d1a9d1a678756571c136db3d57425
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.317 × 10⁹⁵(96-digit number)
13178640943459641919…43374197707127827899
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.317 × 10⁹⁵(96-digit number)
13178640943459641919…43374197707127827899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.635 × 10⁹⁵(96-digit number)
26357281886919283838…86748395414255655799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.271 × 10⁹⁵(96-digit number)
52714563773838567677…73496790828511311599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.054 × 10⁹⁶(97-digit number)
10542912754767713535…46993581657022623199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.108 × 10⁹⁶(97-digit number)
21085825509535427070…93987163314045246399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.217 × 10⁹⁶(97-digit number)
42171651019070854141…87974326628090492799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.434 × 10⁹⁶(97-digit number)
84343302038141708283…75948653256180985599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.686 × 10⁹⁷(98-digit number)
16868660407628341656…51897306512361971199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.373 × 10⁹⁷(98-digit number)
33737320815256683313…03794613024723942399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.747 × 10⁹⁷(98-digit number)
67474641630513366627…07589226049447884799
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,773,313 XPM·at block #6,816,148 · 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