Block #2,760,838

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/22/2018, 11:56:22 PM · Difficulty 11.6539 · 4,084,091 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
70aa5f909bd0c232f2c0afa46f0fb689d730e98fc3a0f0f27fc93020b9e5af64

Height

#2,760,838

Difficulty

11.653857

Transactions

33

Size

8.04 KB

Version

2

Bits

0ba7632f

Nonce

333,516,043

Timestamp

7/22/2018, 11:56:22 PM

Confirmations

4,084,091

Merkle Root

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

6.984 × 10⁹⁶(97-digit number)
69843244287268750679…08659329165710909441
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
6.984 × 10⁹⁶(97-digit number)
69843244287268750679…08659329165710909441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.396 × 10⁹⁷(98-digit number)
13968648857453750135…17318658331421818881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.793 × 10⁹⁷(98-digit number)
27937297714907500271…34637316662843637761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.587 × 10⁹⁷(98-digit number)
55874595429815000543…69274633325687275521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.117 × 10⁹⁸(99-digit number)
11174919085963000108…38549266651374551041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.234 × 10⁹⁸(99-digit number)
22349838171926000217…77098533302749102081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.469 × 10⁹⁸(99-digit number)
44699676343852000434…54197066605498204161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.939 × 10⁹⁸(99-digit number)
89399352687704000869…08394133210996408321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.787 × 10⁹⁹(100-digit number)
17879870537540800173…16788266421992816641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.575 × 10⁹⁹(100-digit number)
35759741075081600347…33576532843985633281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.151 × 10⁹⁹(100-digit number)
71519482150163200695…67153065687971266561
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:58,003,849 XPM·at block #6,844,928 · 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