Block #867,802

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/25/2014, 1:44:11 PM · Difficulty 10.9626 · 5,946,675 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4a51af960b7cf0d129569ba73e54bd7caf23f147ed998bb1e5e874427beff21b

Height

#867,802

Difficulty

10.962560

Transactions

8

Size

2.18 KB

Version

2

Bits

0af66a4f

Nonce

844,495,937

Timestamp

12/25/2014, 1:44:11 PM

Confirmations

5,946,675

Merkle Root

41dbf5737c933b71b7b938287a8736658009589c5cb3c364a9ef8f839df4caff
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.

4.217 × 10⁹⁷(98-digit number)
42175826896774083260…45229787270571130881
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
4.217 × 10⁹⁷(98-digit number)
42175826896774083260…45229787270571130881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.435 × 10⁹⁷(98-digit number)
84351653793548166520…90459574541142261761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.687 × 10⁹⁸(99-digit number)
16870330758709633304…80919149082284523521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.374 × 10⁹⁸(99-digit number)
33740661517419266608…61838298164569047041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.748 × 10⁹⁸(99-digit number)
67481323034838533216…23676596329138094081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.349 × 10⁹⁹(100-digit number)
13496264606967706643…47353192658276188161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.699 × 10⁹⁹(100-digit number)
26992529213935413286…94706385316552376321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.398 × 10⁹⁹(100-digit number)
53985058427870826572…89412770633104752641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.079 × 10¹⁰⁰(101-digit number)
10797011685574165314…78825541266209505281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.159 × 10¹⁰⁰(101-digit number)
21594023371148330629…57651082532419010561
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,759,891 XPM·at block #6,814,476 · 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