Block #2,783,617

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/7/2018, 5:09:24 PM · Difficulty 11.6646 · 4,053,166 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6c0d60fa19e3efb01091055207fd7337f2ed2f6610d08a6c59d34887b435e236

Height

#2,783,617

Difficulty

11.664563

Transactions

6

Size

2.12 KB

Version

2

Bits

0baa20c7

Nonce

121,514,131

Timestamp

8/7/2018, 5:09:24 PM

Confirmations

4,053,166

Merkle Root

6472951abb5eafccefe59f77a127c15b69244af03968afd7e4b1c7c57793dc8e
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.

3.277 × 10⁹⁴(95-digit number)
32779299133890780569…54777903296759362841
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
3.277 × 10⁹⁴(95-digit number)
32779299133890780569…54777903296759362841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.555 × 10⁹⁴(95-digit number)
65558598267781561138…09555806593518725681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.311 × 10⁹⁵(96-digit number)
13111719653556312227…19111613187037451361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.622 × 10⁹⁵(96-digit number)
26223439307112624455…38223226374074902721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.244 × 10⁹⁵(96-digit number)
52446878614225248910…76446452748149805441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.048 × 10⁹⁶(97-digit number)
10489375722845049782…52892905496299610881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.097 × 10⁹⁶(97-digit number)
20978751445690099564…05785810992599221761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.195 × 10⁹⁶(97-digit number)
41957502891380199128…11571621985198443521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.391 × 10⁹⁶(97-digit number)
83915005782760398257…23143243970396887041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.678 × 10⁹⁷(98-digit number)
16783001156552079651…46286487940793774081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.356 × 10⁹⁷(98-digit number)
33566002313104159302…92572975881587548161
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,938,543 XPM·at block #6,836,782 · 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