Block #481,814

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/9/2014, 3:13:42 AM · Difficulty 10.5366 · 6,324,446 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4b06526ad759eebba039c2e6e8b2f61388991b8fabc52bb28523c77071db050f

Height

#481,814

Difficulty

10.536627

Transactions

4

Size

1.00 KB

Version

2

Bits

0a896062

Nonce

23,338

Timestamp

4/9/2014, 3:13:42 AM

Confirmations

6,324,446

Merkle Root

4137a8c147f74dda13ac30df1a120f8cfa07fe9a2e6494256449f6a209dcbf57
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.

7.669 × 10⁹⁹(100-digit number)
76694249667277556344…17688386570779184999
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
7.669 × 10⁹⁹(100-digit number)
76694249667277556344…17688386570779184999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.533 × 10¹⁰⁰(101-digit number)
15338849933455511268…35376773141558369999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.067 × 10¹⁰⁰(101-digit number)
30677699866911022537…70753546283116739999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.135 × 10¹⁰⁰(101-digit number)
61355399733822045075…41507092566233479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.227 × 10¹⁰¹(102-digit number)
12271079946764409015…83014185132466959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.454 × 10¹⁰¹(102-digit number)
24542159893528818030…66028370264933919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.908 × 10¹⁰¹(102-digit number)
49084319787057636060…32056740529867839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.816 × 10¹⁰¹(102-digit number)
98168639574115272121…64113481059735679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.963 × 10¹⁰²(103-digit number)
19633727914823054424…28226962119471359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.926 × 10¹⁰²(103-digit number)
39267455829646108848…56453924238942719999
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,694,164 XPM·at block #6,806,259 · 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