Block #2,783,920

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/7/2018, 10:00:51 PM · Difficulty 11.6652 · 4,054,496 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f1ab87cbcfe63f6bb8a6e1da7ccc3bb2c3441055fb842bc51fbb053311184c59

Height

#2,783,920

Difficulty

11.665198

Transactions

17

Size

4.16 KB

Version

2

Bits

0baa4a68

Nonce

1,080,963,355

Timestamp

8/7/2018, 10:00:51 PM

Confirmations

4,054,496

Merkle Root

42455e5221eb66f4d8676d07823ede58a00dd352ea42ec336a1c15c8ef125326
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.

9.598 × 10⁹⁶(97-digit number)
95980574276948499120…44824428478217277441
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
9.598 × 10⁹⁶(97-digit number)
95980574276948499120…44824428478217277441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.919 × 10⁹⁷(98-digit number)
19196114855389699824…89648856956434554881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.839 × 10⁹⁷(98-digit number)
38392229710779399648…79297713912869109761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.678 × 10⁹⁷(98-digit number)
76784459421558799296…58595427825738219521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.535 × 10⁹⁸(99-digit number)
15356891884311759859…17190855651476439041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.071 × 10⁹⁸(99-digit number)
30713783768623519718…34381711302952878081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.142 × 10⁹⁸(99-digit number)
61427567537247039436…68763422605905756161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.228 × 10⁹⁹(100-digit number)
12285513507449407887…37526845211811512321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.457 × 10⁹⁹(100-digit number)
24571027014898815774…75053690423623024641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.914 × 10⁹⁹(100-digit number)
49142054029797631549…50107380847246049281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.828 × 10⁹⁹(100-digit number)
98284108059595263098…00214761694492098561
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,951,601 XPM·at block #6,838,415 · 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