Block #391,250

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/5/2014, 4:40:30 PM · Difficulty 10.4304 · 6,417,031 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a6bdfab0a7c97de929dc651d13b65ab0a6de38b13bf0bfba42bf9d35f6276adf

Height

#391,250

Difficulty

10.430361

Transactions

13

Size

2.84 KB

Version

2

Bits

0a6e2c24

Nonce

10,223

Timestamp

2/5/2014, 4:40:30 PM

Confirmations

6,417,031

Merkle Root

ad59c8a2c2109b752beaca372a050f37fdd6df7fb08c321fd4a8c611ea634845
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.

3.355 × 10¹⁰²(103-digit number)
33555723055059845910…51815990752969983599
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
3.355 × 10¹⁰²(103-digit number)
33555723055059845910…51815990752969983599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.711 × 10¹⁰²(103-digit number)
67111446110119691821…03631981505939967199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.342 × 10¹⁰³(104-digit number)
13422289222023938364…07263963011879934399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.684 × 10¹⁰³(104-digit number)
26844578444047876728…14527926023759868799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.368 × 10¹⁰³(104-digit number)
53689156888095753457…29055852047519737599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.073 × 10¹⁰⁴(105-digit number)
10737831377619150691…58111704095039475199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.147 × 10¹⁰⁴(105-digit number)
21475662755238301382…16223408190078950399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.295 × 10¹⁰⁴(105-digit number)
42951325510476602765…32446816380157900799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.590 × 10¹⁰⁴(105-digit number)
85902651020953205531…64893632760315801599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.718 × 10¹⁰⁵(106-digit number)
17180530204190641106…29787265520631603199
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,710,299 XPM·at block #6,808,280 · 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.

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