Block #864,482

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/23/2014, 6:18:46 AM · Difficulty 10.9625 · 5,946,671 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
40fdcf1deb74a22fab817e0fa7ef6554534ce1491c049d3388231c2b2fbfc715

Height

#864,482

Difficulty

10.962505

Transactions

9

Size

2.52 KB

Version

2

Bits

0af666c1

Nonce

248,906,842

Timestamp

12/23/2014, 6:18:46 AM

Confirmations

5,946,671

Merkle Root

f7a84c3380fd60b167a2f0cda14af8c59ce64fd19a148e67179c72e5a98047e3
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.457 × 10⁹⁵(96-digit number)
14576468650140449573…87233493182738204101
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.457 × 10⁹⁵(96-digit number)
14576468650140449573…87233493182738204101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.915 × 10⁹⁵(96-digit number)
29152937300280899147…74466986365476408201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.830 × 10⁹⁵(96-digit number)
58305874600561798294…48933972730952816401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.166 × 10⁹⁶(97-digit number)
11661174920112359658…97867945461905632801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.332 × 10⁹⁶(97-digit number)
23322349840224719317…95735890923811265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.664 × 10⁹⁶(97-digit number)
46644699680449438635…91471781847622531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.328 × 10⁹⁶(97-digit number)
93289399360898877271…82943563695245062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.865 × 10⁹⁷(98-digit number)
18657879872179775454…65887127390490124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.731 × 10⁹⁷(98-digit number)
37315759744359550908…31774254780980249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.463 × 10⁹⁷(98-digit number)
74631519488719101817…63548509561960499201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.492 × 10⁹⁸(99-digit number)
14926303897743820363…27097019123920998401
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,733,334 XPM·at block #6,811,152 · 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