Block #483,836

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/10/2014, 6:33:51 AM · Difficulty 10.5711 · 6,326,298 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c2d28074b14f788c8276685e66c11f65e3c78c9895ab81131187649861a76cd6

Height

#483,836

Difficulty

10.571105

Transactions

4

Size

4.58 KB

Version

2

Bits

0a9233ea

Nonce

41,490

Timestamp

4/10/2014, 6:33:51 AM

Confirmations

6,326,298

Merkle Root

07dd7fab2b572ea6520ee0d717aca2d6fba47fae1024906eecaaae765caea36c
Transactions (4)
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.738 × 10¹⁰¹(102-digit number)
57380112065536955316…12090931609289564159
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.738 × 10¹⁰¹(102-digit number)
57380112065536955316…12090931609289564159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.147 × 10¹⁰²(103-digit number)
11476022413107391063…24181863218579128319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.295 × 10¹⁰²(103-digit number)
22952044826214782126…48363726437158256639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.590 × 10¹⁰²(103-digit number)
45904089652429564253…96727452874316513279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.180 × 10¹⁰²(103-digit number)
91808179304859128506…93454905748633026559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.836 × 10¹⁰³(104-digit number)
18361635860971825701…86909811497266053119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.672 × 10¹⁰³(104-digit number)
36723271721943651402…73819622994532106239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.344 × 10¹⁰³(104-digit number)
73446543443887302805…47639245989064212479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.468 × 10¹⁰⁴(105-digit number)
14689308688777460561…95278491978128424959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.937 × 10¹⁰⁴(105-digit number)
29378617377554921122…90556983956256849919
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,725,139 XPM·at block #6,810,133 · 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