Block #397,453

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/10/2014, 2:55:56 AM · Difficulty 10.4124 · 6,420,523 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8d58a8f66a198f92b6f0e7230809a5fe2d78e84c0fa9f11ae963ecf0a02e2db5

Height

#397,453

Difficulty

10.412379

Transactions

3

Size

1.76 KB

Version

2

Bits

0a6991a7

Nonce

75,913

Timestamp

2/10/2014, 2:55:56 AM

Confirmations

6,420,523

Merkle Root

4fde2bcde9c07ac87936145b81bbdab2e89cf1c9cf8f2408bf6da6416a9123e9
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.

7.919 × 10⁹¹(92-digit number)
79198780059644505843…75226141690200779799
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
7.919 × 10⁹¹(92-digit number)
79198780059644505843…75226141690200779799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.583 × 10⁹²(93-digit number)
15839756011928901168…50452283380401559599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.167 × 10⁹²(93-digit number)
31679512023857802337…00904566760803119199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.335 × 10⁹²(93-digit number)
63359024047715604674…01809133521606238399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.267 × 10⁹³(94-digit number)
12671804809543120934…03618267043212476799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.534 × 10⁹³(94-digit number)
25343609619086241869…07236534086424953599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.068 × 10⁹³(94-digit number)
50687219238172483739…14473068172849907199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.013 × 10⁹⁴(95-digit number)
10137443847634496747…28946136345699814399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.027 × 10⁹⁴(95-digit number)
20274887695268993495…57892272691399628799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.054 × 10⁹⁴(95-digit number)
40549775390537986991…15784545382799257599
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,787,878 XPM·at block #6,817,975 · 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