Block #2,679,267

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/26/2018, 9:24:51 PM · Difficulty 11.6938 · 4,162,987 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c28367958387cc88f4a8b85f1b8654c45ca095924e7b3664b9491846b6a4ed0c

Height

#2,679,267

Difficulty

11.693799

Transactions

2

Size

1.14 KB

Version

2

Bits

0bb19cd5

Nonce

1,486,628,309

Timestamp

5/26/2018, 9:24:51 PM

Confirmations

4,162,987

Merkle Root

849bf6334f4f288b11a3e78a1c908a67af2a527991751e77fbc475c74e6b7d97
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.

6.868 × 10⁹⁶(97-digit number)
68681747881124315238…17301243194334330881
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.868 × 10⁹⁶(97-digit number)
68681747881124315238…17301243194334330881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.373 × 10⁹⁷(98-digit number)
13736349576224863047…34602486388668661761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.747 × 10⁹⁷(98-digit number)
27472699152449726095…69204972777337323521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.494 × 10⁹⁷(98-digit number)
54945398304899452191…38409945554674647041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.098 × 10⁹⁸(99-digit number)
10989079660979890438…76819891109349294081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.197 × 10⁹⁸(99-digit number)
21978159321959780876…53639782218698588161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.395 × 10⁹⁸(99-digit number)
43956318643919561752…07279564437397176321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.791 × 10⁹⁸(99-digit number)
87912637287839123505…14559128874794352641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.758 × 10⁹⁹(100-digit number)
17582527457567824701…29118257749588705281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.516 × 10⁹⁹(100-digit number)
35165054915135649402…58236515499177410561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.033 × 10⁹⁹(100-digit number)
70330109830271298804…16473030998354821121
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,982,429 XPM·at block #6,842,253 · 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