Block #484,782

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/10/2014, 5:25:44 PM · Difficulty 10.5958 · 6,340,854 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
835c0bdd0ca5e4e6296fafb064401cfae497f2d429e9f05e894d9f7e69ac6f11

Height

#484,782

Difficulty

10.595754

Transactions

5

Size

1.08 KB

Version

2

Bits

0a988351

Nonce

322,612

Timestamp

4/10/2014, 5:25:44 PM

Confirmations

6,340,854

Merkle Root

82a3cc7aec36c51b704712b89e6c4597f072f3e467135c75ba93a62e96b7fa8f
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.

6.577 × 10¹⁰¹(102-digit number)
65779291977102110297…39641571232159512479
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
6.577 × 10¹⁰¹(102-digit number)
65779291977102110297…39641571232159512479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.315 × 10¹⁰²(103-digit number)
13155858395420422059…79283142464319024959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.631 × 10¹⁰²(103-digit number)
26311716790840844118…58566284928638049919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.262 × 10¹⁰²(103-digit number)
52623433581681688237…17132569857276099839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.052 × 10¹⁰³(104-digit number)
10524686716336337647…34265139714552199679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.104 × 10¹⁰³(104-digit number)
21049373432672675295…68530279429104399359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.209 × 10¹⁰³(104-digit number)
42098746865345350590…37060558858208798719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.419 × 10¹⁰³(104-digit number)
84197493730690701180…74121117716417597439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.683 × 10¹⁰⁴(105-digit number)
16839498746138140236…48242235432835194879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.367 × 10¹⁰⁴(105-digit number)
33678997492276280472…96484470865670389759
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,849,191 XPM·at block #6,825,635 · 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