Block #516,195

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/29/2014, 5:39:49 AM · Difficulty 10.8452 · 6,293,249 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
631b623436cc3e28749838423cb64846de7d3b21470ae460102bb549bdcc6438

Height

#516,195

Difficulty

10.845181

Transactions

2

Size

547 B

Version

2

Bits

0ad85dce

Nonce

71,611,223

Timestamp

4/29/2014, 5:39:49 AM

Confirmations

6,293,249

Merkle Root

95a5a5a00bf3b2b09baa02ec0f146b6e4664667b0d58efc2e6d358b258c6225e
Transactions (2)
1 in → 1 out8.5000 XPM116 B
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.689 × 10⁹⁸(99-digit number)
56899344071742458354…02128170594715354399
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.689 × 10⁹⁸(99-digit number)
56899344071742458354…02128170594715354399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.137 × 10⁹⁹(100-digit number)
11379868814348491670…04256341189430708799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.275 × 10⁹⁹(100-digit number)
22759737628696983341…08512682378861417599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.551 × 10⁹⁹(100-digit number)
45519475257393966683…17025364757722835199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.103 × 10⁹⁹(100-digit number)
91038950514787933367…34050729515445670399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.820 × 10¹⁰⁰(101-digit number)
18207790102957586673…68101459030891340799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.641 × 10¹⁰⁰(101-digit number)
36415580205915173346…36202918061782681599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.283 × 10¹⁰⁰(101-digit number)
72831160411830346693…72405836123565363199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.456 × 10¹⁰¹(102-digit number)
14566232082366069338…44811672247130726399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.913 × 10¹⁰¹(102-digit number)
29132464164732138677…89623344494261452799
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,719,622 XPM·at block #6,809,443 · 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