Block #552,284

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/19/2014, 9:22:37 AM · Difficulty 10.9626 · 6,256,637 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6294847d554949f56512741a6b71d9061ceb5122a75a178da0f707670a6875a4

Height

#552,284

Difficulty

10.962602

Transactions

8

Size

2.73 KB

Version

2

Bits

0af66d12

Nonce

228,765,034

Timestamp

5/19/2014, 9:22:37 AM

Confirmations

6,256,637

Merkle Root

b639c6f22626d900a34071826d9cd0ae8b202b9691ee867fdf8f21179a8760f0
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.

6.878 × 10⁹⁸(99-digit number)
68789950165218863714…53150968762235326721
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
6.878 × 10⁹⁸(99-digit number)
68789950165218863714…53150968762235326721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.375 × 10⁹⁹(100-digit number)
13757990033043772742…06301937524470653441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.751 × 10⁹⁹(100-digit number)
27515980066087545485…12603875048941306881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.503 × 10⁹⁹(100-digit number)
55031960132175090971…25207750097882613761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.100 × 10¹⁰⁰(101-digit number)
11006392026435018194…50415500195765227521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.201 × 10¹⁰⁰(101-digit number)
22012784052870036388…00831000391530455041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.402 × 10¹⁰⁰(101-digit number)
44025568105740072777…01662000783060910081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.805 × 10¹⁰⁰(101-digit number)
88051136211480145554…03324001566121820161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.761 × 10¹⁰¹(102-digit number)
17610227242296029110…06648003132243640321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.522 × 10¹⁰¹(102-digit number)
35220454484592058221…13296006264487280641
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,715,424 XPM·at block #6,808,920 · 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