Block #2,762,117

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/23/2018, 8:47:42 PM · Difficulty 11.6557 · 4,049,036 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b272955eb4204f4010eb53ffb929a8a93dea0adfb154791708d76cf2dc02e77a

Height

#2,762,117

Difficulty

11.655656

Transactions

8

Size

2.89 KB

Version

2

Bits

0ba7d919

Nonce

66,184,221

Timestamp

7/23/2018, 8:47:42 PM

Confirmations

4,049,036

Merkle Root

c82759fc75f79b5c7a91f4db5568874e6499f54d50cc7f740e2025d5a8da4005
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.041 × 10⁹⁶(97-digit number)
10418336636268039632…74431567011357102081
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.041 × 10⁹⁶(97-digit number)
10418336636268039632…74431567011357102081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.083 × 10⁹⁶(97-digit number)
20836673272536079264…48863134022714204161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.167 × 10⁹⁶(97-digit number)
41673346545072158528…97726268045428408321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.334 × 10⁹⁶(97-digit number)
83346693090144317057…95452536090856816641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.666 × 10⁹⁷(98-digit number)
16669338618028863411…90905072181713633281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.333 × 10⁹⁷(98-digit number)
33338677236057726822…81810144363427266561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.667 × 10⁹⁷(98-digit number)
66677354472115453645…63620288726854533121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.333 × 10⁹⁸(99-digit number)
13335470894423090729…27240577453709066241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.667 × 10⁹⁸(99-digit number)
26670941788846181458…54481154907418132481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.334 × 10⁹⁸(99-digit number)
53341883577692362916…08962309814836264961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.066 × 10⁹⁹(100-digit number)
10668376715538472583…17924619629672529921
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,733,334 XPM·at block #6,811,152 · 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.

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