Block #532,586

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2014, 4:38:38 AM · Difficulty 10.8977 · 6,277,738 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e14906f661bfc67003a6a2623991ba8a8936265b9df0784d64b45c107c5ee075

Height

#532,586

Difficulty

10.897690

Transactions

6

Size

1.31 KB

Version

2

Bits

0ae5ceff

Nonce

12,821,080

Timestamp

5/9/2014, 4:38:38 AM

Confirmations

6,277,738

Merkle Root

3c1fcdc965c32475541c753d10fc73a6467c7d3224d344b09befce5a9413bcb3
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.

4.778 × 10⁹⁸(99-digit number)
47781395794617206499…18829620842681630001
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
4.778 × 10⁹⁸(99-digit number)
47781395794617206499…18829620842681630001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.556 × 10⁹⁸(99-digit number)
95562791589234412998…37659241685363260001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.911 × 10⁹⁹(100-digit number)
19112558317846882599…75318483370726520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.822 × 10⁹⁹(100-digit number)
38225116635693765199…50636966741453040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.645 × 10⁹⁹(100-digit number)
76450233271387530398…01273933482906080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.529 × 10¹⁰⁰(101-digit number)
15290046654277506079…02547866965812160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.058 × 10¹⁰⁰(101-digit number)
30580093308555012159…05095733931624320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.116 × 10¹⁰⁰(101-digit number)
61160186617110024318…10191467863248640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.223 × 10¹⁰¹(102-digit number)
12232037323422004863…20382935726497280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.446 × 10¹⁰¹(102-digit number)
24464074646844009727…40765871452994560001
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,726,671 XPM·at block #6,810,323 · 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