Block #466,241

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/30/2014, 1:06:32 AM · Difficulty 10.4217 · 6,343,276 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0bb02a805460363e5b2db0a7e8e7dc7ca37283f2521f18722960f4901d83b11a

Height

#466,241

Difficulty

10.421700

Transactions

7

Size

1.78 KB

Version

2

Bits

0a6bf482

Nonce

16,782,122

Timestamp

3/30/2014, 1:06:32 AM

Confirmations

6,343,276

Merkle Root

e2631b81b799de32e45e3d1a2f9525dd11ed6cc48969a38e4a10642abea70f03
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.469 × 10⁹⁷(98-digit number)
34696628920646134151…43872846262349280161
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.469 × 10⁹⁷(98-digit number)
34696628920646134151…43872846262349280161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.939 × 10⁹⁷(98-digit number)
69393257841292268302…87745692524698560321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.387 × 10⁹⁸(99-digit number)
13878651568258453660…75491385049397120641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.775 × 10⁹⁸(99-digit number)
27757303136516907321…50982770098794241281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.551 × 10⁹⁸(99-digit number)
55514606273033814642…01965540197588482561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.110 × 10⁹⁹(100-digit number)
11102921254606762928…03931080395176965121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.220 × 10⁹⁹(100-digit number)
22205842509213525856…07862160790353930241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.441 × 10⁹⁹(100-digit number)
44411685018427051713…15724321580707860481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.882 × 10⁹⁹(100-digit number)
88823370036854103427…31448643161415720961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.776 × 10¹⁰⁰(101-digit number)
17764674007370820685…62897286322831441921
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,720,212 XPM·at block #6,809,516 · 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.

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