Block #441,563

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/13/2014, 5:43:10 AM · Difficulty 10.3490 · 6,383,451 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c4ab14f90764feb5175f330fa6647024d83bc3da257b7717fa37c33cd6076aa6

Height

#441,563

Difficulty

10.349023

Transactions

2

Size

429 B

Version

2

Bits

0a59598a

Nonce

311,452

Timestamp

3/13/2014, 5:43:10 AM

Confirmations

6,383,451

Merkle Root

2a6ad55d9d087e500c967a8ee9aa78a5e99b9d48ff56b77516890786d5f603ec
Transactions (2)
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.459 × 10⁹⁹(100-digit number)
84594203578750705207…91552518541532678399
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.459 × 10⁹⁹(100-digit number)
84594203578750705207…91552518541532678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.691 × 10¹⁰⁰(101-digit number)
16918840715750141041…83105037083065356799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.383 × 10¹⁰⁰(101-digit number)
33837681431500282083…66210074166130713599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.767 × 10¹⁰⁰(101-digit number)
67675362863000564166…32420148332261427199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.353 × 10¹⁰¹(102-digit number)
13535072572600112833…64840296664522854399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.707 × 10¹⁰¹(102-digit number)
27070145145200225666…29680593329045708799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.414 × 10¹⁰¹(102-digit number)
54140290290400451332…59361186658091417599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.082 × 10¹⁰²(103-digit number)
10828058058080090266…18722373316182835199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.165 × 10¹⁰²(103-digit number)
21656116116160180533…37444746632365670399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.331 × 10¹⁰²(103-digit number)
43312232232320361066…74889493264731340799
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,844,197 XPM·at block #6,825,013 · 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