Block #872,377

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/28/2014, 4:09:34 PM · Difficulty 10.9635 · 5,953,921 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8ec6476f3d69e808fa18136f860fad5dc672a8a7f704ecc286e13212cc7f3a4c

Height

#872,377

Difficulty

10.963509

Transactions

17

Size

4.71 KB

Version

2

Bits

0af6a881

Nonce

1,212,765,349

Timestamp

12/28/2014, 4:09:34 PM

Confirmations

5,953,921

Merkle Root

8754b831abd4960d4719d55b7e6d267c804bdef8118057897d39fd01203e62e9
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.

8.115 × 10⁹⁵(96-digit number)
81156209578881593134…35397000355205705601
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
8.115 × 10⁹⁵(96-digit number)
81156209578881593134…35397000355205705601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.623 × 10⁹⁶(97-digit number)
16231241915776318626…70794000710411411201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.246 × 10⁹⁶(97-digit number)
32462483831552637253…41588001420822822401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.492 × 10⁹⁶(97-digit number)
64924967663105274507…83176002841645644801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.298 × 10⁹⁷(98-digit number)
12984993532621054901…66352005683291289601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.596 × 10⁹⁷(98-digit number)
25969987065242109803…32704011366582579201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.193 × 10⁹⁷(98-digit number)
51939974130484219606…65408022733165158401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.038 × 10⁹⁸(99-digit number)
10387994826096843921…30816045466330316801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.077 × 10⁹⁸(99-digit number)
20775989652193687842…61632090932660633601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.155 × 10⁹⁸(99-digit number)
41551979304387375684…23264181865321267201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.310 × 10⁹⁸(99-digit number)
83103958608774751369…46528363730642534401
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,854,522 XPM·at block #6,826,297 · 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