Block #463,807

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/28/2014, 9:34:12 AM · Difficulty 10.4135 · 6,361,657 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e3c9c5a547a8384bc145a293e106d4b5bd6b077f0f597de27dccdb004f6cd9a0

Height

#463,807

Difficulty

10.413480

Transactions

1

Size

869 B

Version

2

Bits

0a69d9cd

Nonce

2,134

Timestamp

3/28/2014, 9:34:12 AM

Confirmations

6,361,657

Merkle Root

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

3.160 × 10¹⁰⁰(101-digit number)
31602662925685373983…94347916972578915841
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
3.160 × 10¹⁰⁰(101-digit number)
31602662925685373983…94347916972578915841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.320 × 10¹⁰⁰(101-digit number)
63205325851370747967…88695833945157831681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.264 × 10¹⁰¹(102-digit number)
12641065170274149593…77391667890315663361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.528 × 10¹⁰¹(102-digit number)
25282130340548299187…54783335780631326721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.056 × 10¹⁰¹(102-digit number)
50564260681096598374…09566671561262653441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.011 × 10¹⁰²(103-digit number)
10112852136219319674…19133343122525306881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.022 × 10¹⁰²(103-digit number)
20225704272438639349…38266686245050613761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.045 × 10¹⁰²(103-digit number)
40451408544877278699…76533372490101227521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.090 × 10¹⁰²(103-digit number)
80902817089754557398…53066744980202455041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.618 × 10¹⁰³(104-digit number)
16180563417950911479…06133489960404910081
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,847,815 XPM·at block #6,825,463 · 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