Block #525,503

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/4/2014, 7:34:52 PM · Difficulty 10.8802 · 6,283,283 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
32c0fd8d3fb1a03ed35d6e5d07056f6b75ad8d7dde0b2ab3f04eb53d2ccb0930

Height

#525,503

Difficulty

10.880183

Transactions

3

Size

2.84 KB

Version

2

Bits

0ae153aa

Nonce

1,090,162,496

Timestamp

5/4/2014, 7:34:52 PM

Confirmations

6,283,283

Merkle Root

5905845143b0b2db7db94129968c7becee939395b3f9ef030cbc8eaaf8da41f3
Transactions (3)
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.484 × 10⁸⁹(90-digit number)
14843440675451521777…13946039489579923129
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.484 × 10⁸⁹(90-digit number)
14843440675451521777…13946039489579923129
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.968 × 10⁸⁹(90-digit number)
29686881350903043555…27892078979159846259
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.937 × 10⁸⁹(90-digit number)
59373762701806087110…55784157958319692519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.187 × 10⁹⁰(91-digit number)
11874752540361217422…11568315916639385039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.374 × 10⁹⁰(91-digit number)
23749505080722434844…23136631833278770079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.749 × 10⁹⁰(91-digit number)
47499010161444869688…46273263666557540159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.499 × 10⁹⁰(91-digit number)
94998020322889739377…92546527333115080319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.899 × 10⁹¹(92-digit number)
18999604064577947875…85093054666230160639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.799 × 10⁹¹(92-digit number)
37999208129155895750…70186109332460321279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.599 × 10⁹¹(92-digit number)
75998416258311791501…40372218664920642559
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,714,339 XPM·at block #6,808,785 · 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