Block #389,915

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/4/2014, 7:37:40 PM · Difficulty 10.4219 · 6,418,069 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
369b9a9eab78fa36bf4c966b9f289e5183527d2b96696870c767e51c8deeeb3e

Height

#389,915

Difficulty

10.421930

Transactions

10

Size

3.39 KB

Version

2

Bits

0a6c03a2

Nonce

6,580

Timestamp

2/4/2014, 7:37:40 PM

Confirmations

6,418,069

Merkle Root

45365d2c7a8b8eb10f32a23b8c5a2f4b8c1bd84a1c802c17ad5ab5952cf1e96c
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.463 × 10¹⁰²(103-digit number)
54630125753196749350…41582997133538099199
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.463 × 10¹⁰²(103-digit number)
54630125753196749350…41582997133538099199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.092 × 10¹⁰³(104-digit number)
10926025150639349870…83165994267076198399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.185 × 10¹⁰³(104-digit number)
21852050301278699740…66331988534152396799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.370 × 10¹⁰³(104-digit number)
43704100602557399480…32663977068304793599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.740 × 10¹⁰³(104-digit number)
87408201205114798961…65327954136609587199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.748 × 10¹⁰⁴(105-digit number)
17481640241022959792…30655908273219174399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.496 × 10¹⁰⁴(105-digit number)
34963280482045919584…61311816546438348799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.992 × 10¹⁰⁴(105-digit number)
69926560964091839169…22623633092876697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.398 × 10¹⁰⁵(106-digit number)
13985312192818367833…45247266185753395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.797 × 10¹⁰⁵(106-digit number)
27970624385636735667…90494532371506790399
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,707,918 XPM·at block #6,807,983 · 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