Block #555,547

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/21/2014, 3:34:59 PM · Difficulty 10.9628 · 6,269,872 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
840b5dd4716aab318d74d8384bd75fef29cad0264ec26989223fa1adbaf841ed

Height

#555,547

Difficulty

10.962784

Transactions

4

Size

1.44 KB

Version

2

Bits

0af67901

Nonce

1,304,617,751

Timestamp

5/21/2014, 3:34:59 PM

Confirmations

6,269,872

Merkle Root

e6cfe6fded332b2f9b9e77451a1872aaa9ab0019c61880c62e60cb5e3434d14b
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.341 × 10⁹⁹(100-digit number)
13412870177355884699…37176516912223201281
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.341 × 10⁹⁹(100-digit number)
13412870177355884699…37176516912223201281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.682 × 10⁹⁹(100-digit number)
26825740354711769398…74353033824446402561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.365 × 10⁹⁹(100-digit number)
53651480709423538796…48706067648892805121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.073 × 10¹⁰⁰(101-digit number)
10730296141884707759…97412135297785610241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.146 × 10¹⁰⁰(101-digit number)
21460592283769415518…94824270595571220481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.292 × 10¹⁰⁰(101-digit number)
42921184567538831037…89648541191142440961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.584 × 10¹⁰⁰(101-digit number)
85842369135077662075…79297082382284881921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.716 × 10¹⁰¹(102-digit number)
17168473827015532415…58594164764569763841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.433 × 10¹⁰¹(102-digit number)
34336947654031064830…17188329529139527681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.867 × 10¹⁰¹(102-digit number)
68673895308062129660…34376659058279055361
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,847,453 XPM·at block #6,825,418 · 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.
Privacy Policy·

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