Block #543,732

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/14/2014, 1:15:55 PM · Difficulty 10.9484 · 6,271,406 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8f5fff6b0e7446dcd50ac6422e48b6b29a1fc40e694ffef39d2fd904d0db5b37

Height

#543,732

Difficulty

10.948433

Transactions

2

Size

432 B

Version

2

Bits

0af2cc81

Nonce

2,678,339,279

Timestamp

5/14/2014, 1:15:55 PM

Confirmations

6,271,406

Merkle Root

8577fd95c8aae33c13e9dd80f4db8e75111610edd2465d6fe23b4a02315270a0
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.

1.349 × 10⁹⁸(99-digit number)
13493347139964044620…35200984796129497321
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.349 × 10⁹⁸(99-digit number)
13493347139964044620…35200984796129497321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.698 × 10⁹⁸(99-digit number)
26986694279928089241…70401969592258994641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.397 × 10⁹⁸(99-digit number)
53973388559856178482…40803939184517989281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.079 × 10⁹⁹(100-digit number)
10794677711971235696…81607878369035978561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.158 × 10⁹⁹(100-digit number)
21589355423942471393…63215756738071957121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.317 × 10⁹⁹(100-digit number)
43178710847884942786…26431513476143914241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.635 × 10⁹⁹(100-digit number)
86357421695769885572…52863026952287828481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.727 × 10¹⁰⁰(101-digit number)
17271484339153977114…05726053904575656961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.454 × 10¹⁰⁰(101-digit number)
34542968678307954229…11452107809151313921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.908 × 10¹⁰⁰(101-digit number)
69085937356615908458…22904215618302627841
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,765,197 XPM·at block #6,815,137 · 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