Block #554,650

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/21/2014, 12:55:13 AM · Difficulty 10.9626 · 6,253,152 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1fc975d8958ceb3943c57af2827f36420e5f2cc474b6011e974e50dec5735001

Height

#554,650

Difficulty

10.962630

Transactions

7

Size

1.53 KB

Version

2

Bits

0af66ee5

Nonce

13,876,087

Timestamp

5/21/2014, 12:55:13 AM

Confirmations

6,253,152

Merkle Root

f2f3f1aac3ee574067d50d112b3b571fb4a6f1e90ecf2a53ab0896a0a8d891aa
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.388 × 10⁹⁸(99-digit number)
13887463338127029396…80787322501404703681
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.388 × 10⁹⁸(99-digit number)
13887463338127029396…80787322501404703681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.777 × 10⁹⁸(99-digit number)
27774926676254058793…61574645002809407361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.554 × 10⁹⁸(99-digit number)
55549853352508117586…23149290005618814721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.110 × 10⁹⁹(100-digit number)
11109970670501623517…46298580011237629441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.221 × 10⁹⁹(100-digit number)
22219941341003247034…92597160022475258881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.443 × 10⁹⁹(100-digit number)
44439882682006494068…85194320044950517761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.887 × 10⁹⁹(100-digit number)
88879765364012988137…70388640089901035521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.777 × 10¹⁰⁰(101-digit number)
17775953072802597627…40777280179802071041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.555 × 10¹⁰⁰(101-digit number)
35551906145605195255…81554560359604142081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.110 × 10¹⁰⁰(101-digit number)
71103812291210390510…63109120719208284161
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,706,450 XPM·at block #6,807,801 · 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