Block #482,435

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/9/2014, 11:55:12 AM · Difficulty 10.5458 · 6,334,606 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7bde4493bd02cf1d77ee147e5e4909f70b436d72ce206c1df48c99f1fe3816c5

Height

#482,435

Difficulty

10.545784

Transactions

3

Size

1.21 KB

Version

2

Bits

0a8bb87b

Nonce

15,400

Timestamp

4/9/2014, 11:55:12 AM

Confirmations

6,334,606

Merkle Root

60993cb6512005b1dbd0261b7f9c7dcaa71c50c74baef04b5e93b1407b43de94
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.

5.103 × 10⁹⁸(99-digit number)
51033475565470372579…37378806813085081599
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
5.103 × 10⁹⁸(99-digit number)
51033475565470372579…37378806813085081599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.020 × 10⁹⁹(100-digit number)
10206695113094074515…74757613626170163199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.041 × 10⁹⁹(100-digit number)
20413390226188149031…49515227252340326399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.082 × 10⁹⁹(100-digit number)
40826780452376298063…99030454504680652799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.165 × 10⁹⁹(100-digit number)
81653560904752596127…98060909009361305599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.633 × 10¹⁰⁰(101-digit number)
16330712180950519225…96121818018722611199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.266 × 10¹⁰⁰(101-digit number)
32661424361901038451…92243636037445222399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.532 × 10¹⁰⁰(101-digit number)
65322848723802076902…84487272074890444799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.306 × 10¹⁰¹(102-digit number)
13064569744760415380…68974544149780889599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.612 × 10¹⁰¹(102-digit number)
26129139489520830760…37949088299561779199
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,780,359 XPM·at block #6,817,040 · 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