Block #544,877

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/15/2014, 2:36:27 AM · Difficulty 10.9519 · 6,266,231 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f281b6b3699ace547b319db6df8f3c5e6a08db2f57add29c7ea77044a0756f98

Height

#544,877

Difficulty

10.951866

Transactions

3

Size

2.63 KB

Version

2

Bits

0af3ad80

Nonce

108,774,313

Timestamp

5/15/2014, 2:36:27 AM

Confirmations

6,266,231

Merkle Root

936ac0f3312978866d54961f820e239663b9f3775f5dc35f67ac1cbde06eed8b
Transactions (3)
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.123 × 10⁹⁸(99-digit number)
31233501969681628571…39584460481855762201
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.123 × 10⁹⁸(99-digit number)
31233501969681628571…39584460481855762201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.246 × 10⁹⁸(99-digit number)
62467003939363257143…79168920963711524401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.249 × 10⁹⁹(100-digit number)
12493400787872651428…58337841927423048801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.498 × 10⁹⁹(100-digit number)
24986801575745302857…16675683854846097601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.997 × 10⁹⁹(100-digit number)
49973603151490605714…33351367709692195201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.994 × 10⁹⁹(100-digit number)
99947206302981211429…66702735419384390401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.998 × 10¹⁰⁰(101-digit number)
19989441260596242285…33405470838768780801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.997 × 10¹⁰⁰(101-digit number)
39978882521192484571…66810941677537561601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.995 × 10¹⁰⁰(101-digit number)
79957765042384969143…33621883355075123201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.599 × 10¹⁰¹(102-digit number)
15991553008476993828…67243766710150246401
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,971 XPM·at block #6,811,107 · 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