Block #523,482

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/3/2014, 3:10:50 PM · Difficulty 10.8723 · 6,292,573 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
066b80b2dda2c856f6f7d7e59ebdebfda704a291a894da9413f82a49e463dd2d

Height

#523,482

Difficulty

10.872278

Transactions

3

Size

1.22 KB

Version

2

Bits

0adf4d9b

Nonce

145,556,616

Timestamp

5/3/2014, 3:10:50 PM

Confirmations

6,292,573

Merkle Root

da5ca8e9c862ba27acb6ff1f7820f2cc26e617d661be4dac3948040182bae02d
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.365 × 10⁹⁹(100-digit number)
53656924709921557466…94875658034450820799
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.365 × 10⁹⁹(100-digit number)
53656924709921557466…94875658034450820799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.073 × 10¹⁰⁰(101-digit number)
10731384941984311493…89751316068901641599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.146 × 10¹⁰⁰(101-digit number)
21462769883968622986…79502632137803283199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.292 × 10¹⁰⁰(101-digit number)
42925539767937245973…59005264275606566399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.585 × 10¹⁰⁰(101-digit number)
85851079535874491946…18010528551213132799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.717 × 10¹⁰¹(102-digit number)
17170215907174898389…36021057102426265599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.434 × 10¹⁰¹(102-digit number)
34340431814349796778…72042114204852531199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.868 × 10¹⁰¹(102-digit number)
68680863628699593556…44084228409705062399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.373 × 10¹⁰²(103-digit number)
13736172725739918711…88168456819410124799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.747 × 10¹⁰²(103-digit number)
27472345451479837422…76336913638820249599
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