Block #541,328

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/13/2014, 11:28:50 AM · Difficulty 10.9388 · 6,267,042 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b5ec7b48bd6be4fea85267f2b51b4766e16edc699c300bfea3e5d2dfb6dd15eb

Height

#541,328

Difficulty

10.938771

Transactions

3

Size

1.08 KB

Version

2

Bits

0af0534c

Nonce

14,889,345

Timestamp

5/13/2014, 11:28:50 AM

Confirmations

6,267,042

Merkle Root

8f158722ff3b1ebbf19814af3a262888505bb9e38f24b080e5d6b7e7f731ec62
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.

2.098 × 10¹⁰⁰(101-digit number)
20987546634791888130…86298492115559669761
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
2.098 × 10¹⁰⁰(101-digit number)
20987546634791888130…86298492115559669761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.197 × 10¹⁰⁰(101-digit number)
41975093269583776261…72596984231119339521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.395 × 10¹⁰⁰(101-digit number)
83950186539167552522…45193968462238679041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.679 × 10¹⁰¹(102-digit number)
16790037307833510504…90387936924477358081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.358 × 10¹⁰¹(102-digit number)
33580074615667021009…80775873848954716161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.716 × 10¹⁰¹(102-digit number)
67160149231334042018…61551747697909432321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.343 × 10¹⁰²(103-digit number)
13432029846266808403…23103495395818864641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.686 × 10¹⁰²(103-digit number)
26864059692533616807…46206990791637729281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.372 × 10¹⁰²(103-digit number)
53728119385067233614…92413981583275458561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.074 × 10¹⁰³(104-digit number)
10745623877013446722…84827963166550917121
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,711,014 XPM·at block #6,808,369 · 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