Block #1,798,506

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/8/2016, 8:58:27 PM · Difficulty 10.7758 · 5,018,375 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
770ac4d3d525b8d417c42b33bd685d8e8c6101566adc07f0b34979819ee94860

Height

#1,798,506

Difficulty

10.775754

Transactions

11

Size

8.36 KB

Version

2

Bits

0ac697ca

Nonce

11,461,841

Timestamp

10/8/2016, 8:58:27 PM

Confirmations

5,018,375

Merkle Root

794e0ec6a26067687d679a6c4836729fbc8bd1a2d60014a910fedaad470fe16a
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.163 × 10⁹²(93-digit number)
41635304607124463121…41533397164449940801
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.163 × 10⁹²(93-digit number)
41635304607124463121…41533397164449940801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.327 × 10⁹²(93-digit number)
83270609214248926242…83066794328899881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.665 × 10⁹³(94-digit number)
16654121842849785248…66133588657799763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.330 × 10⁹³(94-digit number)
33308243685699570497…32267177315599526401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.661 × 10⁹³(94-digit number)
66616487371399140994…64534354631199052801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.332 × 10⁹⁴(95-digit number)
13323297474279828198…29068709262398105601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.664 × 10⁹⁴(95-digit number)
26646594948559656397…58137418524796211201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.329 × 10⁹⁴(95-digit number)
53293189897119312795…16274837049592422401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.065 × 10⁹⁵(96-digit number)
10658637979423862559…32549674099184844801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.131 × 10⁹⁵(96-digit number)
21317275958847725118…65099348198369689601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.263 × 10⁹⁵(96-digit number)
42634551917695450236…30198696396739379201
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,779,087 XPM·at block #6,816,880 · 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