Block #481,812

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/9/2014, 3:09:17 AM · Difficulty 10.5365 · 6,327,726 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d21abf8427300c78383ff71f8f010d0d107b072f8df414fc5f4563204882b2ff

Height

#481,812

Difficulty

10.536533

Transactions

5

Size

1.02 KB

Version

2

Bits

0a895a41

Nonce

233,607,494

Timestamp

4/9/2014, 3:09:17 AM

Confirmations

6,327,726

Merkle Root

e71a42995196572e31d03adeaafe65c5aa328c13f4c31842ea962e6f3af17233
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.

2.051 × 10¹⁰⁰(101-digit number)
20514620664845419829…25029951585638318079
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
2.051 × 10¹⁰⁰(101-digit number)
20514620664845419829…25029951585638318079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.102 × 10¹⁰⁰(101-digit number)
41029241329690839659…50059903171276636159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.205 × 10¹⁰⁰(101-digit number)
82058482659381679319…00119806342553272319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.641 × 10¹⁰¹(102-digit number)
16411696531876335863…00239612685106544639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.282 × 10¹⁰¹(102-digit number)
32823393063752671727…00479225370213089279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.564 × 10¹⁰¹(102-digit number)
65646786127505343455…00958450740426178559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.312 × 10¹⁰²(103-digit number)
13129357225501068691…01916901480852357119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.625 × 10¹⁰²(103-digit number)
26258714451002137382…03833802961704714239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.251 × 10¹⁰²(103-digit number)
52517428902004274764…07667605923409428479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.050 × 10¹⁰³(104-digit number)
10503485780400854952…15335211846818856959
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,720,383 XPM·at block #6,809,537 · 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