Block #478,407

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/7/2014, 1:42:10 AM · Difficulty 10.4931 · 6,332,587 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4125510f2a11d81ee831cfcb9857f7e2688f4c881284ea9c0ecebeacd07b6e77

Height

#478,407

Difficulty

10.493065

Transactions

3

Size

659 B

Version

2

Bits

0a7e397b

Nonce

21,953

Timestamp

4/7/2014, 1:42:10 AM

Confirmations

6,332,587

Merkle Root

cd2e3aabf69dd26026a5cbe90854401a9a5e4ed325550bb7c8917074e3014488
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.437 × 10⁹⁹(100-digit number)
14371032324833487618…02265804829537009159
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.437 × 10⁹⁹(100-digit number)
14371032324833487618…02265804829537009159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.874 × 10⁹⁹(100-digit number)
28742064649666975236…04531609659074018319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.748 × 10⁹⁹(100-digit number)
57484129299333950473…09063219318148036639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.149 × 10¹⁰⁰(101-digit number)
11496825859866790094…18126438636296073279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.299 × 10¹⁰⁰(101-digit number)
22993651719733580189…36252877272592146559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.598 × 10¹⁰⁰(101-digit number)
45987303439467160378…72505754545184293119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.197 × 10¹⁰⁰(101-digit number)
91974606878934320757…45011509090368586239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.839 × 10¹⁰¹(102-digit number)
18394921375786864151…90023018180737172479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.678 × 10¹⁰¹(102-digit number)
36789842751573728303…80046036361474344959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.357 × 10¹⁰¹(102-digit number)
73579685503147456606…60092072722948689919
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,732,056 XPM·at block #6,810,993 · 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