Block #517,115

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2014, 6:11:10 PM · Difficulty 10.8504 · 6,328,201 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3af4152d88ffcda6f767c8d1dccfca402b5b5c3e3db54321e811c36cea0e248d

Height

#517,115

Difficulty

10.850426

Transactions

3

Size

1.78 KB

Version

2

Bits

0ad9b588

Nonce

1,982,715

Timestamp

4/29/2014, 6:11:10 PM

Confirmations

6,328,201

Merkle Root

6a429107d90cc47bc3c79477ec5f7b8ee63d2965bc25f20c0ce2eea247e4a0d7
Transactions (3)
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.

6.077 × 10⁹⁷(98-digit number)
60771301164582739699…86075349621182992961
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
6.077 × 10⁹⁷(98-digit number)
60771301164582739699…86075349621182992961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.215 × 10⁹⁸(99-digit number)
12154260232916547939…72150699242365985921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.430 × 10⁹⁸(99-digit number)
24308520465833095879…44301398484731971841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.861 × 10⁹⁸(99-digit number)
48617040931666191759…88602796969463943681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.723 × 10⁹⁸(99-digit number)
97234081863332383518…77205593938927887361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.944 × 10⁹⁹(100-digit number)
19446816372666476703…54411187877855774721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.889 × 10⁹⁹(100-digit number)
38893632745332953407…08822375755711549441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.778 × 10⁹⁹(100-digit number)
77787265490665906814…17644751511423098881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.555 × 10¹⁰⁰(101-digit number)
15557453098133181362…35289503022846197761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.111 × 10¹⁰⁰(101-digit number)
31114906196266362725…70579006045692395521
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,006,969 XPM·at block #6,845,315 · 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