Block #1,353,923

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2015, 12:04:59 PM · Difficulty 10.8009 · 5,457,021 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3d3ad51080e58d4a30ba90f6b59a221509c284bf6117975909fd932db16b5115

Height

#1,353,923

Difficulty

10.800858

Transactions

2

Size

1.11 KB

Version

2

Bits

0acd050c

Nonce

944,343,193

Timestamp

12/4/2015, 12:04:59 PM

Confirmations

5,457,021

Merkle Root

dd52ca9ae933e22ab3e98c6733771ec0d80e6459944138b39fed37399375d192
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.007 × 10⁹⁵(96-digit number)
10070113344242766793…18699855363481939201
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.007 × 10⁹⁵(96-digit number)
10070113344242766793…18699855363481939201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.014 × 10⁹⁵(96-digit number)
20140226688485533587…37399710726963878401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.028 × 10⁹⁵(96-digit number)
40280453376971067175…74799421453927756801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.056 × 10⁹⁵(96-digit number)
80560906753942134351…49598842907855513601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.611 × 10⁹⁶(97-digit number)
16112181350788426870…99197685815711027201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.222 × 10⁹⁶(97-digit number)
32224362701576853740…98395371631422054401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.444 × 10⁹⁶(97-digit number)
64448725403153707481…96790743262844108801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.288 × 10⁹⁷(98-digit number)
12889745080630741496…93581486525688217601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.577 × 10⁹⁷(98-digit number)
25779490161261482992…87162973051376435201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.155 × 10⁹⁷(98-digit number)
51558980322522965984…74325946102752870401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.031 × 10⁹⁸(99-digit number)
10311796064504593196…48651892205505740801
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,731,650 XPM·at block #6,810,943 · 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