Block #343,947

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/5/2014, 12:11:44 AM · Difficulty 10.1862 · 6,471,163 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4f274603a96ddf4e35e52eedeace51b23c04af3c47cb61a2eb0fce380a36d27a

Height

#343,947

Difficulty

10.186199

Transactions

6

Size

6.36 KB

Version

2

Bits

0a2faabf

Nonce

243,550

Timestamp

1/5/2014, 12:11:44 AM

Confirmations

6,471,163

Merkle Root

5b4f416eaa197ae59226c6e1610f446b36411bbc82abd8605ecdde12d87aa579
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.252 × 10⁹⁹(100-digit number)
52526858050740733801…73268064349723935999
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.252 × 10⁹⁹(100-digit number)
52526858050740733801…73268064349723935999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.050 × 10¹⁰⁰(101-digit number)
10505371610148146760…46536128699447871999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.101 × 10¹⁰⁰(101-digit number)
21010743220296293520…93072257398895743999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.202 × 10¹⁰⁰(101-digit number)
42021486440592587041…86144514797791487999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.404 × 10¹⁰⁰(101-digit number)
84042972881185174082…72289029595582975999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.680 × 10¹⁰¹(102-digit number)
16808594576237034816…44578059191165951999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.361 × 10¹⁰¹(102-digit number)
33617189152474069633…89156118382331903999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.723 × 10¹⁰¹(102-digit number)
67234378304948139266…78312236764663807999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.344 × 10¹⁰²(103-digit number)
13446875660989627853…56624473529327615999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.689 × 10¹⁰²(103-digit number)
26893751321979255706…13248947058655231999
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,764,971 XPM·at block #6,815,109 · 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