Block #531,351

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/8/2014, 11:04:27 AM · Difficulty 10.8939 · 6,276,679 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6c0a210064ee239c86d5d5af31e681bc215273a31f7fac8b4887094393a24e2a

Height

#531,351

Difficulty

10.893892

Transactions

14

Size

51.21 KB

Version

2

Bits

0ae4d61d

Nonce

445,432

Timestamp

5/8/2014, 11:04:27 AM

Confirmations

6,276,679

Merkle Root

6180ad49a101950b9d7d0b40c39d405e090423e15a18b7b6a880f17c73cd7a35
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.

2.296 × 10⁹⁹(100-digit number)
22963330567688210147…19705289109717745521
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
2.296 × 10⁹⁹(100-digit number)
22963330567688210147…19705289109717745521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.592 × 10⁹⁹(100-digit number)
45926661135376420294…39410578219435491041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.185 × 10⁹⁹(100-digit number)
91853322270752840589…78821156438870982081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.837 × 10¹⁰⁰(101-digit number)
18370664454150568117…57642312877741964161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.674 × 10¹⁰⁰(101-digit number)
36741328908301136235…15284625755483928321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.348 × 10¹⁰⁰(101-digit number)
73482657816602272471…30569251510967856641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.469 × 10¹⁰¹(102-digit number)
14696531563320454494…61138503021935713281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.939 × 10¹⁰¹(102-digit number)
29393063126640908988…22277006043871426561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.878 × 10¹⁰¹(102-digit number)
58786126253281817977…44554012087742853121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.175 × 10¹⁰²(103-digit number)
11757225250656363595…89108024175485706241
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,708,284 XPM·at block #6,808,029 · 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