Block #516,835

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/29/2014, 2:15:39 PM · Difficulty 10.8490 · 6,289,554 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
54ad63671a2a8355aec1231b881d578b7f1d7a8fcdbe88e7b6878905aaf88b67

Height

#516,835

Difficulty

10.848998

Transactions

2

Size

434 B

Version

2

Bits

0ad957eb

Nonce

129,902,731

Timestamp

4/29/2014, 2:15:39 PM

Confirmations

6,289,554

Merkle Root

344c98f685bc29c602da345102b6b21ae2019114a2b7cffe3a29a811beb1132a
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.

1.701 × 10⁹⁹(100-digit number)
17012187766211475598…16031603700849759999
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
1.701 × 10⁹⁹(100-digit number)
17012187766211475598…16031603700849759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.402 × 10⁹⁹(100-digit number)
34024375532422951197…32063207401699519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.804 × 10⁹⁹(100-digit number)
68048751064845902394…64126414803399039999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.360 × 10¹⁰⁰(101-digit number)
13609750212969180478…28252829606798079999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.721 × 10¹⁰⁰(101-digit number)
27219500425938360957…56505659213596159999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.443 × 10¹⁰⁰(101-digit number)
54439000851876721915…13011318427192319999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.088 × 10¹⁰¹(102-digit number)
10887800170375344383…26022636854384639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.177 × 10¹⁰¹(102-digit number)
21775600340750688766…52045273708769279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.355 × 10¹⁰¹(102-digit number)
43551200681501377532…04090547417538559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.710 × 10¹⁰¹(102-digit number)
87102401363002755064…08181094835077119999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,695,202 XPM·at block #6,806,388 · 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