Block #517,210

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/29/2014, 7:33:30 PM · Difficulty 10.8508 · 6,325,316 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4934f7137ca92803dd72416ecfa27f2cd96a5351340599d7bf3449cfefd7544c

Height

#517,210

Difficulty

10.850757

Transactions

2

Size

708 B

Version

2

Bits

0ad9cb2f

Nonce

1,903,834

Timestamp

4/29/2014, 7:33:30 PM

Confirmations

6,325,316

Merkle Root

03460076e75931db079f04f1669aad4a0b4e2c2f9b02a4bff2a36de8ae568de8
Transactions (2)
1 in → 1 out8.4900 XPM116 B
4 in → 1 out40.7500 XPM500 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.

1.024 × 10⁹⁹(100-digit number)
10244930383102799516…37133481717878200399
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.024 × 10⁹⁹(100-digit number)
10244930383102799516…37133481717878200399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.048 × 10⁹⁹(100-digit number)
20489860766205599033…74266963435756400799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.097 × 10⁹⁹(100-digit number)
40979721532411198066…48533926871512801599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.195 × 10⁹⁹(100-digit number)
81959443064822396133…97067853743025603199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.639 × 10¹⁰⁰(101-digit number)
16391888612964479226…94135707486051206399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.278 × 10¹⁰⁰(101-digit number)
32783777225928958453…88271414972102412799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.556 × 10¹⁰⁰(101-digit number)
65567554451857916906…76542829944204825599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.311 × 10¹⁰¹(102-digit number)
13113510890371583381…53085659888409651199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.622 × 10¹⁰¹(102-digit number)
26227021780743166762…06171319776819302399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.245 × 10¹⁰¹(102-digit number)
52454043561486333525…12342639553638604799
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,984,629 XPM·at block #6,842,525 · 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