Block #2,827,783

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/6/2018, 8:59:44 PM · Difficulty 11.7114 · 4,009,098 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d6d3083a911e2ddacf85cee6711a35630065ff56b738c58a463fd236aa1fbb1d

Height

#2,827,783

Difficulty

11.711395

Transactions

11

Size

3.29 KB

Version

2

Bits

0bb61df9

Nonce

512,529,925

Timestamp

9/6/2018, 8:59:44 PM

Confirmations

4,009,098

Merkle Root

2392735a2732a99d3f6e23dc70005966e141a837356625b04c81f4ad73cb956f
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.337 × 10⁹⁶(97-digit number)
13375952487603291567…85429091371433863201
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.337 × 10⁹⁶(97-digit number)
13375952487603291567…85429091371433863201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.675 × 10⁹⁶(97-digit number)
26751904975206583135…70858182742867726401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.350 × 10⁹⁶(97-digit number)
53503809950413166271…41716365485735452801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.070 × 10⁹⁷(98-digit number)
10700761990082633254…83432730971470905601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.140 × 10⁹⁷(98-digit number)
21401523980165266508…66865461942941811201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.280 × 10⁹⁷(98-digit number)
42803047960330533017…33730923885883622401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.560 × 10⁹⁷(98-digit number)
85606095920661066034…67461847771767244801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.712 × 10⁹⁸(99-digit number)
17121219184132213206…34923695543534489601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.424 × 10⁹⁸(99-digit number)
34242438368264426413…69847391087068979201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.848 × 10⁹⁸(99-digit number)
68484876736528852827…39694782174137958401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.369 × 10⁹⁹(100-digit number)
13696975347305770565…79389564348275916801
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,939,339 XPM·at block #6,836,880 · 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