Block #528,826

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/6/2014, 9:09:25 PM · Difficulty 10.8884 · 6,280,879 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2ddb420ac1c3e266798a5d5b4073c7d77c4524a33a89cac199a50ed89364d4eb

Height

#528,826

Difficulty

10.888375

Transactions

5

Size

1.43 KB

Version

2

Bits

0ae36c92

Nonce

26,213,052

Timestamp

5/6/2014, 9:09:25 PM

Confirmations

6,280,879

Merkle Root

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

1.647 × 10⁹⁹(100-digit number)
16477929019680920887…70141275388369518401
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
1.647 × 10⁹⁹(100-digit number)
16477929019680920887…70141275388369518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.295 × 10⁹⁹(100-digit number)
32955858039361841774…40282550776739036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.591 × 10⁹⁹(100-digit number)
65911716078723683548…80565101553478073601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.318 × 10¹⁰⁰(101-digit number)
13182343215744736709…61130203106956147201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.636 × 10¹⁰⁰(101-digit number)
26364686431489473419…22260406213912294401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.272 × 10¹⁰⁰(101-digit number)
52729372862978946838…44520812427824588801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.054 × 10¹⁰¹(102-digit number)
10545874572595789367…89041624855649177601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.109 × 10¹⁰¹(102-digit number)
21091749145191578735…78083249711298355201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.218 × 10¹⁰¹(102-digit number)
42183498290383157471…56166499422596710401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.436 × 10¹⁰¹(102-digit number)
84366996580766314942…12332998845193420801
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,721,719 XPM·at block #6,809,704 · 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