Block #503,917

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/21/2014, 10:52:30 AM · Difficulty 10.8076 · 6,322,926 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
47f43e1b47f1cd6515e8d1aec73a6fe8f17c840a7a850e0cf3936a083275966f

Height

#503,917

Difficulty

10.807603

Transactions

3

Size

660 B

Version

2

Bits

0acebf16

Nonce

490,796,636

Timestamp

4/21/2014, 10:52:30 AM

Confirmations

6,322,926

Merkle Root

82c301e5d98f51cddfc36fa7f7f4918ed58c66ab061982bf74670692547a805a
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.416 × 10⁹⁷(98-digit number)
54166798825165204627…28187967998831548101
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.416 × 10⁹⁷(98-digit number)
54166798825165204627…28187967998831548101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.083 × 10⁹⁸(99-digit number)
10833359765033040925…56375935997663096201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.166 × 10⁹⁸(99-digit number)
21666719530066081851…12751871995326192401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.333 × 10⁹⁸(99-digit number)
43333439060132163702…25503743990652384801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.666 × 10⁹⁸(99-digit number)
86666878120264327404…51007487981304769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.733 × 10⁹⁹(100-digit number)
17333375624052865480…02014975962609539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.466 × 10⁹⁹(100-digit number)
34666751248105730961…04029951925219078401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.933 × 10⁹⁹(100-digit number)
69333502496211461923…08059903850438156801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.386 × 10¹⁰⁰(101-digit number)
13866700499242292384…16119807700876313601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.773 × 10¹⁰⁰(101-digit number)
27733400998484584769…32239615401752627201
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,858,909 XPM·at block #6,826,842 · 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