Block #2,127,195

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/21/2017, 7:36:28 PM · Difficulty 10.9185 · 4,681,427 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fc745eb5aef5cc0b867e389ef61ca23ab667782622a264219784b7f42c325ccd

Height

#2,127,195

Difficulty

10.918533

Transactions

7

Size

14.21 KB

Version

2

Bits

0aeb2500

Nonce

1,780,801,489

Timestamp

5/21/2017, 7:36:28 PM

Confirmations

4,681,427

Merkle Root

a636110f48a13f45626ad3af94a05fa43aba048a8f2259be6d04f5232f5055b3
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.

2.666 × 10⁹⁴(95-digit number)
26669313511856460599…89430786003307321761
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
2.666 × 10⁹⁴(95-digit number)
26669313511856460599…89430786003307321761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.333 × 10⁹⁴(95-digit number)
53338627023712921199…78861572006614643521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.066 × 10⁹⁵(96-digit number)
10667725404742584239…57723144013229287041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.133 × 10⁹⁵(96-digit number)
21335450809485168479…15446288026458574081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.267 × 10⁹⁵(96-digit number)
42670901618970336959…30892576052917148161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.534 × 10⁹⁵(96-digit number)
85341803237940673918…61785152105834296321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.706 × 10⁹⁶(97-digit number)
17068360647588134783…23570304211668592641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.413 × 10⁹⁶(97-digit number)
34136721295176269567…47140608423337185281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.827 × 10⁹⁶(97-digit number)
68273442590352539135…94281216846674370561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.365 × 10⁹⁷(98-digit number)
13654688518070507827…88562433693348741121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.730 × 10⁹⁷(98-digit number)
27309377036141015654…77124867386697482241
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,713,027 XPM·at block #6,808,621 · 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.

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