Block #479,954

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/8/2014, 12:31:25 AM · Difficulty 10.5111 · 6,337,300 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
16f568d0818278d8122c978020b2a5e8f741f9b918865df5d4d9468e043e5e53

Height

#479,954

Difficulty

10.511141

Transactions

1

Size

937 B

Version

2

Bits

0a82da26

Nonce

22,845

Timestamp

4/8/2014, 12:31:25 AM

Confirmations

6,337,300

Merkle Root

3edeb3ccea188a00038a654c9d7f6b3bb00d644b53ad8adb90fe2ee7dfdb8ac1
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.482 × 10⁹⁸(99-digit number)
64827489491893581701…15315247327606976001
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.482 × 10⁹⁸(99-digit number)
64827489491893581701…15315247327606976001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.296 × 10⁹⁹(100-digit number)
12965497898378716340…30630494655213952001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.593 × 10⁹⁹(100-digit number)
25930995796757432680…61260989310427904001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.186 × 10⁹⁹(100-digit number)
51861991593514865361…22521978620855808001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.037 × 10¹⁰⁰(101-digit number)
10372398318702973072…45043957241711616001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.074 × 10¹⁰⁰(101-digit number)
20744796637405946144…90087914483423232001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.148 × 10¹⁰⁰(101-digit number)
41489593274811892289…80175828966846464001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.297 × 10¹⁰⁰(101-digit number)
82979186549623784578…60351657933692928001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.659 × 10¹⁰¹(102-digit number)
16595837309924756915…20703315867385856001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.319 × 10¹⁰¹(102-digit number)
33191674619849513831…41406631734771712001
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,782,067 XPM·at block #6,817,253 · 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