Block #554,330

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/20/2014, 7:11:16 PM · Difficulty 10.9628 · 6,252,182 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d856615ae28a6830bef42816d29544e8248fd14080537858d37a555069b03a18

Height

#554,330

Difficulty

10.962818

Transactions

12

Size

2.91 KB

Version

2

Bits

0af67b3d

Nonce

312,211

Timestamp

5/20/2014, 7:11:16 PM

Confirmations

6,252,182

Merkle Root

00f1f174a2de446b32ea22b86363b9825bbeb4146200ed537d0a2442d861b6b9
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.255 × 10⁹⁹(100-digit number)
12551182105635944820…89296735815553965761
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.255 × 10⁹⁹(100-digit number)
12551182105635944820…89296735815553965761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.510 × 10⁹⁹(100-digit number)
25102364211271889640…78593471631107931521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.020 × 10⁹⁹(100-digit number)
50204728422543779281…57186943262215863041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.004 × 10¹⁰⁰(101-digit number)
10040945684508755856…14373886524431726081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.008 × 10¹⁰⁰(101-digit number)
20081891369017511712…28747773048863452161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.016 × 10¹⁰⁰(101-digit number)
40163782738035023425…57495546097726904321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.032 × 10¹⁰⁰(101-digit number)
80327565476070046850…14991092195453808641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.606 × 10¹⁰¹(102-digit number)
16065513095214009370…29982184390907617281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.213 × 10¹⁰¹(102-digit number)
32131026190428018740…59964368781815234561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.426 × 10¹⁰¹(102-digit number)
64262052380856037480…19928737563630469121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.285 × 10¹⁰²(103-digit number)
12852410476171207496…39857475127260938241
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,696,193 XPM·at block #6,806,511 · 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