Block #879,454

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/2/2015, 4:47:32 PM · Difficulty 10.9625 · 5,954,468 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8bd927f72b062837e189811bc72c146dc635e3890287320dfa6d1988eb5f7819

Height

#879,454

Difficulty

10.962535

Transactions

6

Size

1.45 KB

Version

2

Bits

0af668ab

Nonce

1,488,332,698

Timestamp

1/2/2015, 4:47:32 PM

Confirmations

5,954,468

Merkle Root

f916d703f722d32ab7896f81a7d59f2265f0c1b6308ad0ed7a284c82ac346060
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.594 × 10⁹⁷(98-digit number)
15948937742062587890…43418841772102310401
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.594 × 10⁹⁷(98-digit number)
15948937742062587890…43418841772102310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.189 × 10⁹⁷(98-digit number)
31897875484125175780…86837683544204620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.379 × 10⁹⁷(98-digit number)
63795750968250351560…73675367088409241601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.275 × 10⁹⁸(99-digit number)
12759150193650070312…47350734176818483201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.551 × 10⁹⁸(99-digit number)
25518300387300140624…94701468353636966401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.103 × 10⁹⁸(99-digit number)
51036600774600281248…89402936707273932801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.020 × 10⁹⁹(100-digit number)
10207320154920056249…78805873414547865601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.041 × 10⁹⁹(100-digit number)
20414640309840112499…57611746829095731201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.082 × 10⁹⁹(100-digit number)
40829280619680224998…15223493658191462401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.165 × 10⁹⁹(100-digit number)
81658561239360449997…30446987316382924801
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,915,603 XPM·at block #6,833,921 · 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