Block #493,492

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/15/2014, 5:27:50 PM · Difficulty 10.7015 · 6,314,337 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
61d56d3f73320fbd6cfeb8cf3d43d393291f17bf44d0d4d0c38808610437e967

Height

#493,492

Difficulty

10.701514

Transactions

8

Size

1.90 KB

Version

2

Bits

0ab39672

Nonce

212,247

Timestamp

4/15/2014, 5:27:50 PM

Confirmations

6,314,337

Merkle Root

2f1be13ca12b221257ec8b7894bd2c512f840df3d72633e7acb4a5eae7186320
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.

4.242 × 10¹⁰³(104-digit number)
42423711292062928959…00670961486524866559
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
4.242 × 10¹⁰³(104-digit number)
42423711292062928959…00670961486524866559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.484 × 10¹⁰³(104-digit number)
84847422584125857919…01341922973049733119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.696 × 10¹⁰⁴(105-digit number)
16969484516825171583…02683845946099466239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.393 × 10¹⁰⁴(105-digit number)
33938969033650343167…05367691892198932479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.787 × 10¹⁰⁴(105-digit number)
67877938067300686335…10735383784397864959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.357 × 10¹⁰⁵(106-digit number)
13575587613460137267…21470767568795729919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.715 × 10¹⁰⁵(106-digit number)
27151175226920274534…42941535137591459839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.430 × 10¹⁰⁵(106-digit number)
54302350453840549068…85883070275182919679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.086 × 10¹⁰⁶(107-digit number)
10860470090768109813…71766140550365839359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.172 × 10¹⁰⁶(107-digit number)
21720940181536219627…43532281100731678719
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,706,668 XPM·at block #6,807,828 · 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