Block #547,394

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/16/2014, 11:12:02 AM · Difficulty 10.9571 · 6,267,444 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
55c9863734a4a84a161284699a22fd5bbb6a7c1f3f4938fc0eb61803deafc675

Height

#547,394

Difficulty

10.957050

Transactions

7

Size

88.22 KB

Version

2

Bits

0af5013f

Nonce

457,385,181

Timestamp

5/16/2014, 11:12:02 AM

Confirmations

6,267,444

Merkle Root

b8b404a733597daf78bc128972c43670efec91d3dab0ebe18c65b2e5ad42afd8
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.059 × 10⁹⁷(98-digit number)
10598443719709301761…37964694686270883681
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.059 × 10⁹⁷(98-digit number)
10598443719709301761…37964694686270883681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.119 × 10⁹⁷(98-digit number)
21196887439418603522…75929389372541767361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.239 × 10⁹⁷(98-digit number)
42393774878837207045…51858778745083534721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.478 × 10⁹⁷(98-digit number)
84787549757674414091…03717557490167069441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.695 × 10⁹⁸(99-digit number)
16957509951534882818…07435114980334138881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.391 × 10⁹⁸(99-digit number)
33915019903069765636…14870229960668277761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.783 × 10⁹⁸(99-digit number)
67830039806139531272…29740459921336555521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.356 × 10⁹⁹(100-digit number)
13566007961227906254…59480919842673111041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.713 × 10⁹⁹(100-digit number)
27132015922455812509…18961839685346222081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.426 × 10⁹⁹(100-digit number)
54264031844911625018…37923679370692444161
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,762,787 XPM·at block #6,814,837 · 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