Block #541,199

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/13/2014, 10:18:15 AM · Difficulty 10.9381 · 6,269,836 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
df0b571bd966c9fe0d40a6765a70f432ca6bec517f7993be2673df66b9a76dd5

Height

#541,199

Difficulty

10.938054

Transactions

2

Size

6.35 KB

Version

2

Bits

0af0244c

Nonce

692,226,594

Timestamp

5/13/2014, 10:18:15 AM

Confirmations

6,269,836

Merkle Root

91500f95ae8704f30af5bcf0d6c31a7507f24bfb7632d54d907da29a85b007b7
Transactions (2)
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.010 × 10⁹⁵(96-digit number)
10104396856949203980…75280641513156033601
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.010 × 10⁹⁵(96-digit number)
10104396856949203980…75280641513156033601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.020 × 10⁹⁵(96-digit number)
20208793713898407960…50561283026312067201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.041 × 10⁹⁵(96-digit number)
40417587427796815920…01122566052624134401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.083 × 10⁹⁵(96-digit number)
80835174855593631840…02245132105248268801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.616 × 10⁹⁶(97-digit number)
16167034971118726368…04490264210496537601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.233 × 10⁹⁶(97-digit number)
32334069942237452736…08980528420993075201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.466 × 10⁹⁶(97-digit number)
64668139884474905472…17961056841986150401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.293 × 10⁹⁷(98-digit number)
12933627976894981094…35922113683972300801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.586 × 10⁹⁷(98-digit number)
25867255953789962189…71844227367944601601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.173 × 10⁹⁷(98-digit number)
51734511907579924378…43688454735889203201
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,732,389 XPM·at block #6,811,034 · 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