Block #478,377

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/7/2014, 1:13:59 AM · Difficulty 10.4928 · 6,329,989 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
24db842856608aef2bc4845ee00a9bb041bef24ee045b85a7831bb4ba48ea99d

Height

#478,377

Difficulty

10.492841

Transactions

2

Size

1.10 KB

Version

2

Bits

0a7e2acc

Nonce

11,599

Timestamp

4/7/2014, 1:13:59 AM

Confirmations

6,329,989

Merkle Root

5b6beb4df4102bfc0dffa87a8d5c0278f0a199d9ca9443b9cd9b67b8b424fcd4
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.

8.940 × 10¹⁰²(103-digit number)
89406119388801514242…42032260725145053759
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
8.940 × 10¹⁰²(103-digit number)
89406119388801514242…42032260725145053759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.788 × 10¹⁰³(104-digit number)
17881223877760302848…84064521450290107519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.576 × 10¹⁰³(104-digit number)
35762447755520605696…68129042900580215039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.152 × 10¹⁰³(104-digit number)
71524895511041211393…36258085801160430079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.430 × 10¹⁰⁴(105-digit number)
14304979102208242278…72516171602320860159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.860 × 10¹⁰⁴(105-digit number)
28609958204416484557…45032343204641720319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.721 × 10¹⁰⁴(105-digit number)
57219916408832969114…90064686409283440639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.144 × 10¹⁰⁵(106-digit number)
11443983281766593822…80129372818566881279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.288 × 10¹⁰⁵(106-digit number)
22887966563533187645…60258745637133762559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.577 × 10¹⁰⁵(106-digit number)
45775933127066375291…20517491274267525119
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,710,981 XPM·at block #6,808,365 · 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