Block #531,622

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/8/2014, 2:59:34 PM · Difficulty 10.8947 · 6,286,323 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
60611b86a26e1909914abc9e2df13de5039b1268f0ee5fec8c0ac0a08309d7dc

Height

#531,622

Difficulty

10.894653

Transactions

3

Size

953 B

Version

2

Bits

0ae50801

Nonce

1,372,379

Timestamp

5/8/2014, 2:59:34 PM

Confirmations

6,286,323

Merkle Root

079de14864d46038f6512163d4c5781e5bb5f10c98788e12eec7ae1bc147eb43
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.

9.432 × 10⁹⁹(100-digit number)
94321873298374197449…27304895517801738241
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
9.432 × 10⁹⁹(100-digit number)
94321873298374197449…27304895517801738241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.886 × 10¹⁰⁰(101-digit number)
18864374659674839489…54609791035603476481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.772 × 10¹⁰⁰(101-digit number)
37728749319349678979…09219582071206952961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.545 × 10¹⁰⁰(101-digit number)
75457498638699357959…18439164142413905921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.509 × 10¹⁰¹(102-digit number)
15091499727739871591…36878328284827811841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.018 × 10¹⁰¹(102-digit number)
30182999455479743183…73756656569655623681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.036 × 10¹⁰¹(102-digit number)
60365998910959486367…47513313139311247361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.207 × 10¹⁰²(103-digit number)
12073199782191897273…95026626278622494721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.414 × 10¹⁰²(103-digit number)
24146399564383794547…90053252557244989441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.829 × 10¹⁰²(103-digit number)
48292799128767589094…80106505114489978881
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,787,627 XPM·at block #6,817,944 · 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