Block #345,182

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/5/2014, 6:23:18 PM · Difficulty 10.2093 · 6,469,138 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8caaab8aa73e30c00659ac6688c1ba0f9a08fb27617878ccb3b1e5c44e8cf238

Height

#345,182

Difficulty

10.209326

Transactions

6

Size

5.49 KB

Version

2

Bits

0a359669

Nonce

3,105

Timestamp

1/5/2014, 6:23:18 PM

Confirmations

6,469,138

Merkle Root

99948e66c0c976acdddaf0ce48897c6fe9d500fca685420bbcdd7d14247af0d8
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.299 × 10⁹⁵(96-digit number)
52997065699506955717…71228642588930152649
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.299 × 10⁹⁵(96-digit number)
52997065699506955717…71228642588930152649
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.059 × 10⁹⁶(97-digit number)
10599413139901391143…42457285177860305299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.119 × 10⁹⁶(97-digit number)
21198826279802782287…84914570355720610599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.239 × 10⁹⁶(97-digit number)
42397652559605564574…69829140711441221199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.479 × 10⁹⁶(97-digit number)
84795305119211129148…39658281422882442399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.695 × 10⁹⁷(98-digit number)
16959061023842225829…79316562845764884799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.391 × 10⁹⁷(98-digit number)
33918122047684451659…58633125691529769599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.783 × 10⁹⁷(98-digit number)
67836244095368903318…17266251383059539199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.356 × 10⁹⁸(99-digit number)
13567248819073780663…34532502766119078399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.713 × 10⁹⁸(99-digit number)
27134497638147561327…69065005532238156799
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,758,624 XPM·at block #6,814,319 · 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