Block #2,638,887

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2018, 10:58:38 AM · Difficulty 11.5133 · 4,191,936 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f1c6ec3792826723e66eb1d95af27c26e447e9990f838c74c9d512cdb2ad864c

Height

#2,638,887

Difficulty

11.513312

Transactions

6

Size

2.38 KB

Version

2

Bits

0b836866

Nonce

898,748,382

Timestamp

4/30/2018, 10:58:38 AM

Confirmations

4,191,936

Merkle Root

b325ff9f4cc0c726281f42ebd91cf2ed07be05c70f297d48aeec2026db8e8588
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.682 × 10⁹⁵(96-digit number)
16825764868223178409…72027770463784322561
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.682 × 10⁹⁵(96-digit number)
16825764868223178409…72027770463784322561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.365 × 10⁹⁵(96-digit number)
33651529736446356819…44055540927568645121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.730 × 10⁹⁵(96-digit number)
67303059472892713639…88111081855137290241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.346 × 10⁹⁶(97-digit number)
13460611894578542727…76222163710274580481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.692 × 10⁹⁶(97-digit number)
26921223789157085455…52444327420549160961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.384 × 10⁹⁶(97-digit number)
53842447578314170911…04888654841098321921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.076 × 10⁹⁷(98-digit number)
10768489515662834182…09777309682196643841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.153 × 10⁹⁷(98-digit number)
21536979031325668364…19554619364393287681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.307 × 10⁹⁷(98-digit number)
43073958062651336729…39109238728786575361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.614 × 10⁹⁷(98-digit number)
86147916125302673458…78218477457573150721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.722 × 10⁹⁸(99-digit number)
17229583225060534691…56436954915146301441
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,890,717 XPM·at block #6,830,822 · 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