Block #438,105

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2014, 6:27:07 PM · Difficulty 10.3593 · 6,372,436 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6cf2279a5235219d272150d6cb6ce3d60b1880c18e3bae994f4110ca6d081949

Height

#438,105

Difficulty

10.359313

Transactions

1

Size

834 B

Version

2

Bits

0a5bfbea

Nonce

12,161

Timestamp

3/10/2014, 6:27:07 PM

Confirmations

6,372,436

Merkle Root

1c4d1912d3a68251b7ac96831f591c5731b4aa33f6606f326289873b870a3979
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.

6.790 × 10⁹⁷(98-digit number)
67907879325938016471…64318355729285084751
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
6.790 × 10⁹⁷(98-digit number)
67907879325938016471…64318355729285084751
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.358 × 10⁹⁸(99-digit number)
13581575865187603294…28636711458570169501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.716 × 10⁹⁸(99-digit number)
27163151730375206588…57273422917140339001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.432 × 10⁹⁸(99-digit number)
54326303460750413177…14546845834280678001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.086 × 10⁹⁹(100-digit number)
10865260692150082635…29093691668561356001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.173 × 10⁹⁹(100-digit number)
21730521384300165271…58187383337122712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.346 × 10⁹⁹(100-digit number)
43461042768600330542…16374766674245424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.692 × 10⁹⁹(100-digit number)
86922085537200661084…32749533348490848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.738 × 10¹⁰⁰(101-digit number)
17384417107440132216…65499066696981696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.476 × 10¹⁰⁰(101-digit number)
34768834214880264433…30998133393963392001
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,728,415 XPM·at block #6,810,540 · 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