Block #511,739

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/26/2014, 10:42:43 AM · Difficulty 10.8309 · 6,298,913 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a790f93d53507c27d98dfac10fd12de541e6472272497f0951441b8761cdb8e2

Height

#511,739

Difficulty

10.830852

Transactions

7

Size

2.25 KB

Version

2

Bits

0ad4b2b1

Nonce

106,725,139

Timestamp

4/26/2014, 10:42:43 AM

Confirmations

6,298,913

Merkle Root

5570ef47ddc83bce0ac9e6e26919e0b7942de898fe469874715992d7f76933de
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.

5.016 × 10⁹⁸(99-digit number)
50164356199648102871…56428460211821060361
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
5.016 × 10⁹⁸(99-digit number)
50164356199648102871…56428460211821060361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.003 × 10⁹⁹(100-digit number)
10032871239929620574…12856920423642120721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.006 × 10⁹⁹(100-digit number)
20065742479859241148…25713840847284241441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.013 × 10⁹⁹(100-digit number)
40131484959718482296…51427681694568482881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.026 × 10⁹⁹(100-digit number)
80262969919436964593…02855363389136965761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.605 × 10¹⁰⁰(101-digit number)
16052593983887392918…05710726778273931521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.210 × 10¹⁰⁰(101-digit number)
32105187967774785837…11421453556547863041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.421 × 10¹⁰⁰(101-digit number)
64210375935549571675…22842907113095726081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.284 × 10¹⁰¹(102-digit number)
12842075187109914335…45685814226191452161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.568 × 10¹⁰¹(102-digit number)
25684150374219828670…91371628452382904321
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,729,306 XPM·at block #6,810,651 · 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