Block #2,782,136

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/6/2018, 7:19:39 PM · Difficulty 11.6528 · 4,060,801 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
41f20ac98e0bb27b90ebd5143184c54484e27e93a85e651f8971089d6c33b96a

Height

#2,782,136

Difficulty

11.652849

Transactions

43

Size

12.66 KB

Version

2

Bits

0ba72118

Nonce

1,554,599,318

Timestamp

8/6/2018, 7:19:39 PM

Confirmations

4,060,801

Merkle Root

cdb2bb82c1e3f9a5f333c337d30653497441e1b3baa55e2070a838be796f4bd9
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.

7.482 × 10⁹⁵(96-digit number)
74823793954637970673…09900752325435288321
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
7.482 × 10⁹⁵(96-digit number)
74823793954637970673…09900752325435288321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.496 × 10⁹⁶(97-digit number)
14964758790927594134…19801504650870576641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.992 × 10⁹⁶(97-digit number)
29929517581855188269…39603009301741153281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.985 × 10⁹⁶(97-digit number)
59859035163710376539…79206018603482306561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.197 × 10⁹⁷(98-digit number)
11971807032742075307…58412037206964613121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.394 × 10⁹⁷(98-digit number)
23943614065484150615…16824074413929226241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.788 × 10⁹⁷(98-digit number)
47887228130968301231…33648148827858452481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.577 × 10⁹⁷(98-digit number)
95774456261936602462…67296297655716904961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.915 × 10⁹⁸(99-digit number)
19154891252387320492…34592595311433809921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.830 × 10⁹⁸(99-digit number)
38309782504774640985…69185190622867619841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.661 × 10⁹⁸(99-digit number)
76619565009549281970…38370381245735239681
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,987,846 XPM·at block #6,842,936 · 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