Block #2,819,562

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/1/2018, 6:47:07 AM · Difficulty 11.7015 · 4,013,206 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c500ba3d7c63e1941a234e5a89c0c20437058e0bd2712b8fff5adf98f121cc3b

Height

#2,819,562

Difficulty

11.701549

Transactions

2

Size

870 B

Version

2

Bits

0bb398b0

Nonce

294,214,229

Timestamp

9/1/2018, 6:47:07 AM

Confirmations

4,013,206

Merkle Root

4ccc807c68db2d3f69db9bc1306053bd16ce4fc0914765be9d27ccd58f5568ec
Transactions (2)
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.023 × 10⁹⁵(96-digit number)
10239413542881297255…77738035815908392961
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.023 × 10⁹⁵(96-digit number)
10239413542881297255…77738035815908392961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.047 × 10⁹⁵(96-digit number)
20478827085762594510…55476071631816785921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.095 × 10⁹⁵(96-digit number)
40957654171525189020…10952143263633571841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.191 × 10⁹⁵(96-digit number)
81915308343050378041…21904286527267143681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.638 × 10⁹⁶(97-digit number)
16383061668610075608…43808573054534287361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.276 × 10⁹⁶(97-digit number)
32766123337220151216…87617146109068574721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.553 × 10⁹⁶(97-digit number)
65532246674440302432…75234292218137149441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.310 × 10⁹⁷(98-digit number)
13106449334888060486…50468584436274298881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.621 × 10⁹⁷(98-digit number)
26212898669776120973…00937168872548597761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.242 × 10⁹⁷(98-digit number)
52425797339552241946…01874337745097195521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.048 × 10⁹⁸(99-digit number)
10485159467910448389…03748675490194391041
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,906,308 XPM·at block #6,832,767 · 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