Block #518,285

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2014, 12:08:08 PM · Difficulty 10.8532 · 6,290,275 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bd166aceea59e56872c9871900c42e0ee0564bf562714331747cfd7b2bfc85c2

Height

#518,285

Difficulty

10.853190

Transactions

8

Size

3.01 KB

Version

2

Bits

0ada6aa9

Nonce

116,131

Timestamp

4/30/2014, 12:08:08 PM

Confirmations

6,290,275

Merkle Root

def3542cf5c1eb1c5105468702a539e9e5c57dd2de8b4ec536fd38e8534cb3cd
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.296 × 10⁹⁸(99-digit number)
22969472741833295692…85740700711383420801
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.296 × 10⁹⁸(99-digit number)
22969472741833295692…85740700711383420801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.593 × 10⁹⁸(99-digit number)
45938945483666591385…71481401422766841601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.187 × 10⁹⁸(99-digit number)
91877890967333182771…42962802845533683201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.837 × 10⁹⁹(100-digit number)
18375578193466636554…85925605691067366401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.675 × 10⁹⁹(100-digit number)
36751156386933273108…71851211382134732801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.350 × 10⁹⁹(100-digit number)
73502312773866546217…43702422764269465601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.470 × 10¹⁰⁰(101-digit number)
14700462554773309243…87404845528538931201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.940 × 10¹⁰⁰(101-digit number)
29400925109546618487…74809691057077862401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.880 × 10¹⁰⁰(101-digit number)
58801850219093236974…49619382114155724801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.176 × 10¹⁰¹(102-digit number)
11760370043818647394…99238764228311449601
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,712,538 XPM·at block #6,808,559 · 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