Block #861,626

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/21/2014, 3:20:09 AM · Difficulty 10.9639 · 5,946,793 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
60be09e0010563e85a9853dce1c2b699a12a5d9a43f1813586740b33f5d0ff97

Height

#861,626

Difficulty

10.963887

Transactions

11

Size

3.62 KB

Version

2

Bits

0af6c14d

Nonce

3,017,996,434

Timestamp

12/21/2014, 3:20:09 AM

Confirmations

5,946,793

Merkle Root

d0106477e887aca97fa2e78ace23d7232edb0e50899151a53c3c2ecc70ec4092
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.348 × 10⁹⁶(97-digit number)
63482453996843516706…33621756713806083361
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.348 × 10⁹⁶(97-digit number)
63482453996843516706…33621756713806083361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.269 × 10⁹⁷(98-digit number)
12696490799368703341…67243513427612166721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.539 × 10⁹⁷(98-digit number)
25392981598737406682…34487026855224333441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.078 × 10⁹⁷(98-digit number)
50785963197474813365…68974053710448666881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.015 × 10⁹⁸(99-digit number)
10157192639494962673…37948107420897333761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.031 × 10⁹⁸(99-digit number)
20314385278989925346…75896214841794667521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.062 × 10⁹⁸(99-digit number)
40628770557979850692…51792429683589335041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.125 × 10⁹⁸(99-digit number)
81257541115959701384…03584859367178670081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.625 × 10⁹⁹(100-digit number)
16251508223191940276…07169718734357340161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.250 × 10⁹⁹(100-digit number)
32503016446383880553…14339437468714680321
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,711,411 XPM·at block #6,808,418 · 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