Block #510,027

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/25/2014, 10:02:32 AM · Difficulty 10.8228 · 6,306,028 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b32446045736b07a0d3ddee381823723b30459fd192b14e659ef35595766b426

Height

#510,027

Difficulty

10.822847

Transactions

3

Size

1.22 KB

Version

2

Bits

0ad2a61c

Nonce

17,110,973

Timestamp

4/25/2014, 10:02:32 AM

Confirmations

6,306,028

Merkle Root

b662570781b59c5bf12e7af36a2846a45a46a200a01ec7c9b109a2926848c346
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.

9.845 × 10⁹⁹(100-digit number)
98458501280265231782…73997113169741466879
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
9.845 × 10⁹⁹(100-digit number)
98458501280265231782…73997113169741466879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.969 × 10¹⁰⁰(101-digit number)
19691700256053046356…47994226339482933759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.938 × 10¹⁰⁰(101-digit number)
39383400512106092712…95988452678965867519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.876 × 10¹⁰⁰(101-digit number)
78766801024212185425…91976905357931735039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.575 × 10¹⁰¹(102-digit number)
15753360204842437085…83953810715863470079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.150 × 10¹⁰¹(102-digit number)
31506720409684874170…67907621431726940159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.301 × 10¹⁰¹(102-digit number)
63013440819369748340…35815242863453880319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.260 × 10¹⁰²(103-digit number)
12602688163873949668…71630485726907760639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.520 × 10¹⁰²(103-digit number)
25205376327747899336…43260971453815521279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.041 × 10¹⁰²(103-digit number)
50410752655495798672…86521942907631042559
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,772,555 XPM·at block #6,816,054 · 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