Block #462,091

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/27/2014, 5:19:58 AM · Difficulty 10.4097 · 6,364,253 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
000f24a57ae3b4c3e0f46701934e31f1571aaf594ab17eaf5590367f73f72f08

Height

#462,091

Difficulty

10.409707

Transactions

3

Size

655 B

Version

2

Bits

0a68e292

Nonce

523,953

Timestamp

3/27/2014, 5:19:58 AM

Confirmations

6,364,253

Merkle Root

79cbf4fe40717666ae27c38e6803de9c951a5196bfe94583ad526bcabb30e3c6
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.

1.048 × 10¹⁰⁴(105-digit number)
10486231706043162765…99242114728645711361
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
1.048 × 10¹⁰⁴(105-digit number)
10486231706043162765…99242114728645711361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.097 × 10¹⁰⁴(105-digit number)
20972463412086325530…98484229457291422721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.194 × 10¹⁰⁴(105-digit number)
41944926824172651061…96968458914582845441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.388 × 10¹⁰⁴(105-digit number)
83889853648345302122…93936917829165690881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.677 × 10¹⁰⁵(106-digit number)
16777970729669060424…87873835658331381761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.355 × 10¹⁰⁵(106-digit number)
33555941459338120849…75747671316662763521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.711 × 10¹⁰⁵(106-digit number)
67111882918676241698…51495342633325527041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.342 × 10¹⁰⁶(107-digit number)
13422376583735248339…02990685266651054081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.684 × 10¹⁰⁶(107-digit number)
26844753167470496679…05981370533302108161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.368 × 10¹⁰⁶(107-digit number)
53689506334940993358…11962741066604216321
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,854,896 XPM·at block #6,826,343 · 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