Block #517,187

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2014, 7:15:35 PM · Difficulty 10.8507 · 6,290,780 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
449f51bf76e9605898a62164482b8f80dc9f4704d94d6dda875e0d3e21662392

Height

#517,187

Difficulty

10.850660

Transactions

4

Size

1.45 KB

Version

2

Bits

0ad9c4d3

Nonce

138,595

Timestamp

4/29/2014, 7:15:35 PM

Confirmations

6,290,780

Merkle Root

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

3.182 × 10⁹⁸(99-digit number)
31825979513530971942…54367877284304467841
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
3.182 × 10⁹⁸(99-digit number)
31825979513530971942…54367877284304467841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.365 × 10⁹⁸(99-digit number)
63651959027061943885…08735754568608935681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.273 × 10⁹⁹(100-digit number)
12730391805412388777…17471509137217871361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.546 × 10⁹⁹(100-digit number)
25460783610824777554…34943018274435742721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.092 × 10⁹⁹(100-digit number)
50921567221649555108…69886036548871485441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.018 × 10¹⁰⁰(101-digit number)
10184313444329911021…39772073097742970881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.036 × 10¹⁰⁰(101-digit number)
20368626888659822043…79544146195485941761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.073 × 10¹⁰⁰(101-digit number)
40737253777319644086…59088292390971883521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.147 × 10¹⁰⁰(101-digit number)
81474507554639288173…18176584781943767041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.629 × 10¹⁰¹(102-digit number)
16294901510927857634…36353169563887534081
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,707,779 XPM·at block #6,807,966 · 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