Block #1,396,559

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/2/2016, 11:13:59 PM · Difficulty 10.8106 · 5,412,736 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ed490843431914e9e0e6dd2f5bdcafd09d27fd5d741f2aedfe5d6c1a1ad89d85

Height

#1,396,559

Difficulty

10.810553

Transactions

21

Size

9.06 KB

Version

2

Bits

0acf805f

Nonce

224,976,656

Timestamp

1/2/2016, 11:13:59 PM

Confirmations

5,412,736

Merkle Root

549b5b9d4b37776783524c25bee409c914fa1b2ec355802363c02e2d3a19fb9e
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.260 × 10⁹⁶(97-digit number)
22602963598210884917…94659691684298542081
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.260 × 10⁹⁶(97-digit number)
22602963598210884917…94659691684298542081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.520 × 10⁹⁶(97-digit number)
45205927196421769835…89319383368597084161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.041 × 10⁹⁶(97-digit number)
90411854392843539670…78638766737194168321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.808 × 10⁹⁷(98-digit number)
18082370878568707934…57277533474388336641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.616 × 10⁹⁷(98-digit number)
36164741757137415868…14555066948776673281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.232 × 10⁹⁷(98-digit number)
72329483514274831736…29110133897553346561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.446 × 10⁹⁸(99-digit number)
14465896702854966347…58220267795106693121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.893 × 10⁹⁸(99-digit number)
28931793405709932694…16440535590213386241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.786 × 10⁹⁸(99-digit number)
57863586811419865389…32881071180426772481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.157 × 10⁹⁹(100-digit number)
11572717362283973077…65762142360853544961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.314 × 10⁹⁹(100-digit number)
23145434724567946155…31524284721707089921
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,718,430 XPM·at block #6,809,294 · 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