Block #517,334

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/29/2014, 9:31:26 PM · Difficulty 10.8509 · 6,323,798 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c75c745f169e6d944835f431fbf7ea62af62ddc82d5e71c6e0efeb22efa83b36

Height

#517,334

Difficulty

10.850923

Transactions

2

Size

821 B

Version

2

Bits

0ad9d610

Nonce

1,777,900

Timestamp

4/29/2014, 9:31:26 PM

Confirmations

6,323,798

Merkle Root

b40e7bead48520ca8d5a06766205b60632124542ad30c69ef540064b7c159c6b
Transactions (2)
1 in → 1 out8.4900 XPM116 B
5 in → 1 out51.5400 XPM613 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.

7.652 × 10⁹⁹(100-digit number)
76529549673281444255…25749468451476346879
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
7.652 × 10⁹⁹(100-digit number)
76529549673281444255…25749468451476346879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.530 × 10¹⁰⁰(101-digit number)
15305909934656288851…51498936902952693759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.061 × 10¹⁰⁰(101-digit number)
30611819869312577702…02997873805905387519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.122 × 10¹⁰⁰(101-digit number)
61223639738625155404…05995747611810775039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.224 × 10¹⁰¹(102-digit number)
12244727947725031080…11991495223621550079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.448 × 10¹⁰¹(102-digit number)
24489455895450062161…23982990447243100159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.897 × 10¹⁰¹(102-digit number)
48978911790900124323…47965980894486200319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.795 × 10¹⁰¹(102-digit number)
97957823581800248646…95931961788972400639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.959 × 10¹⁰²(103-digit number)
19591564716360049729…91863923577944801279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.918 × 10¹⁰²(103-digit number)
39183129432720099458…83727847155889602559
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,973,425 XPM·at block #6,841,131 · 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