Block #548,382

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/16/2014, 11:45:06 PM · Difficulty 10.9590 · 6,260,049 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f5e25bd5b7732cd404292e123c1822b7bbd0090cd0959d92b4f86820c01a03c5

Height

#548,382

Difficulty

10.959025

Transactions

12

Size

3.58 KB

Version

2

Bits

0af582ab

Nonce

156,649,892

Timestamp

5/16/2014, 11:45:06 PM

Confirmations

6,260,049

Merkle Root

68802941f5e67c45cb675c23a2066e5c8925111099e1a12c0253677974937f85
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.

9.541 × 10⁹⁷(98-digit number)
95414780496829354464…50093639486770919521
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
9.541 × 10⁹⁷(98-digit number)
95414780496829354464…50093639486770919521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.908 × 10⁹⁸(99-digit number)
19082956099365870892…00187278973541839041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.816 × 10⁹⁸(99-digit number)
38165912198731741785…00374557947083678081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.633 × 10⁹⁸(99-digit number)
76331824397463483571…00749115894167356161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.526 × 10⁹⁹(100-digit number)
15266364879492696714…01498231788334712321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.053 × 10⁹⁹(100-digit number)
30532729758985393428…02996463576669424641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.106 × 10⁹⁹(100-digit number)
61065459517970786857…05992927153338849281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.221 × 10¹⁰⁰(101-digit number)
12213091903594157371…11985854306677698561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.442 × 10¹⁰⁰(101-digit number)
24426183807188314742…23971708613355397121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.885 × 10¹⁰⁰(101-digit number)
48852367614376629485…47943417226710794241
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,509 XPM·at block #6,808,430 · 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