Block #552,997

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/19/2014, 8:34:56 PM · Difficulty 10.9629 · 6,258,085 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c1daeca5bb750da7c89ffe15628b26607c5e2ba3b0dc126807ef331c9092393c

Height

#552,997

Difficulty

10.962916

Transactions

8

Size

3.04 KB

Version

2

Bits

0af681b1

Nonce

175,411

Timestamp

5/19/2014, 8:34:56 PM

Confirmations

6,258,085

Merkle Root

4648f4198acbd9b94d77de33f76f0c4d0448a358cca5ead1a43859761e98deaa
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.

5.121 × 10⁹⁴(95-digit number)
51216482655561286187…52846083865467834561
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
5.121 × 10⁹⁴(95-digit number)
51216482655561286187…52846083865467834561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.024 × 10⁹⁵(96-digit number)
10243296531112257237…05692167730935669121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.048 × 10⁹⁵(96-digit number)
20486593062224514474…11384335461871338241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.097 × 10⁹⁵(96-digit number)
40973186124449028949…22768670923742676481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.194 × 10⁹⁵(96-digit number)
81946372248898057899…45537341847485352961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.638 × 10⁹⁶(97-digit number)
16389274449779611579…91074683694970705921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.277 × 10⁹⁶(97-digit number)
32778548899559223159…82149367389941411841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.555 × 10⁹⁶(97-digit number)
65557097799118446319…64298734779882823681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.311 × 10⁹⁷(98-digit number)
13111419559823689263…28597469559765647361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.622 × 10⁹⁷(98-digit number)
26222839119647378527…57194939119531294721
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,763 XPM·at block #6,811,081 · 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