Block #551,741

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/19/2014, 12:47:31 AM · Difficulty 10.9624 · 6,257,384 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
876755d0877797d56f63a02974d067ea8c4229cd5f84a95b9b3db0720fad47d0

Height

#551,741

Difficulty

10.962363

Transactions

2

Size

6.74 KB

Version

2

Bits

0af65d72

Nonce

557,382,579

Timestamp

5/19/2014, 12:47:31 AM

Confirmations

6,257,384

Merkle Root

01c7437858803c2f3ac905355a4638293e612a348b17c57706dfba2afde0e575
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.

3.111 × 10⁹⁸(99-digit number)
31110264067738358639…16110117245871932801
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
3.111 × 10⁹⁸(99-digit number)
31110264067738358639…16110117245871932801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.222 × 10⁹⁸(99-digit number)
62220528135476717278…32220234491743865601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.244 × 10⁹⁹(100-digit number)
12444105627095343455…64440468983487731201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.488 × 10⁹⁹(100-digit number)
24888211254190686911…28880937966975462401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.977 × 10⁹⁹(100-digit number)
49776422508381373822…57761875933950924801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.955 × 10⁹⁹(100-digit number)
99552845016762747645…15523751867901849601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.991 × 10¹⁰⁰(101-digit number)
19910569003352549529…31047503735803699201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.982 × 10¹⁰⁰(101-digit number)
39821138006705099058…62095007471607398401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.964 × 10¹⁰⁰(101-digit number)
79642276013410198116…24190014943214796801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.592 × 10¹⁰¹(102-digit number)
15928455202682039623…48380029886429593601
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,717,058 XPM·at block #6,809,124 · 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