Block #518,971

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2014, 10:55:33 PM · Difficulty 10.8543 · 6,307,527 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
149c30d94a693f4c6add9495977b8eb9dc88a3ba4fc8717dfabdfb081c8b454f

Height

#518,971

Difficulty

10.854348

Transactions

2

Size

1.44 KB

Version

2

Bits

0adab68d

Nonce

45,704,302

Timestamp

4/30/2014, 10:55:33 PM

Confirmations

6,307,527

Merkle Root

0c4089a9cee2eb173aa6ad642765ad51558a1c61e16369de3bc691531a2ae35d
Transactions (2)
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.

2.661 × 10¹⁰⁰(101-digit number)
26614811388167781299…97996840859448295681
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
2.661 × 10¹⁰⁰(101-digit number)
26614811388167781299…97996840859448295681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.322 × 10¹⁰⁰(101-digit number)
53229622776335562599…95993681718896591361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.064 × 10¹⁰¹(102-digit number)
10645924555267112519…91987363437793182721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.129 × 10¹⁰¹(102-digit number)
21291849110534225039…83974726875586365441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.258 × 10¹⁰¹(102-digit number)
42583698221068450079…67949453751172730881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.516 × 10¹⁰¹(102-digit number)
85167396442136900158…35898907502345461761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.703 × 10¹⁰²(103-digit number)
17033479288427380031…71797815004690923521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.406 × 10¹⁰²(103-digit number)
34066958576854760063…43595630009381847041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.813 × 10¹⁰²(103-digit number)
68133917153709520127…87191260018763694081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.362 × 10¹⁰³(104-digit number)
13626783430741904025…74382520037527388161
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,856,126 XPM·at block #6,826,497 · 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