Block #517,322

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2014, 9:19:54 PM · Difficulty 10.8510 · 6,327,806 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6966a44f9cf85fc59fc730412edace19730dcd69e8dd5e9ef986b8c4de215d94

Height

#517,322

Difficulty

10.850975

Transactions

5

Size

1.68 KB

Version

2

Bits

0ad9d984

Nonce

49,987,458

Timestamp

4/29/2014, 9:19:54 PM

Confirmations

6,327,806

Merkle Root

2256280b79ee4a1dfddf6d7b7076aedd26a5dec9b53afe4431c4bfeefbfb121b
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.081 × 10⁹⁸(99-digit number)
50811382532882182880…30145337922616163361
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.081 × 10⁹⁸(99-digit number)
50811382532882182880…30145337922616163361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.016 × 10⁹⁹(100-digit number)
10162276506576436576…60290675845232326721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.032 × 10⁹⁹(100-digit number)
20324553013152873152…20581351690464653441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.064 × 10⁹⁹(100-digit number)
40649106026305746304…41162703380929306881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.129 × 10⁹⁹(100-digit number)
81298212052611492608…82325406761858613761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.625 × 10¹⁰⁰(101-digit number)
16259642410522298521…64650813523717227521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.251 × 10¹⁰⁰(101-digit number)
32519284821044597043…29301627047434455041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.503 × 10¹⁰⁰(101-digit number)
65038569642089194086…58603254094868910081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.300 × 10¹⁰¹(102-digit number)
13007713928417838817…17206508189737820161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.601 × 10¹⁰¹(102-digit number)
26015427856835677634…34413016379475640321
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:58,005,451 XPM·at block #6,845,127 · 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