Block #1,315,836

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/6/2015, 5:27:16 PM · Difficulty 10.8624 · 5,498,025 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0fe6b4e7ac070556b2a6a0cfb554b6b689472f573848e59208b800d11c349bc4

Height

#1,315,836

Difficulty

10.862449

Transactions

2

Size

2.04 KB

Version

2

Bits

0adcc977

Nonce

1,392,266,182

Timestamp

11/6/2015, 5:27:16 PM

Confirmations

5,498,025

Merkle Root

366fbcb02cceb2f710775854a4933b01053c62f3de6bb9ba4ca5c419e597ff3e
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.

5.708 × 10⁹⁶(97-digit number)
57083246692238387064…23407467393295974401
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
5.708 × 10⁹⁶(97-digit number)
57083246692238387064…23407467393295974401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.141 × 10⁹⁷(98-digit number)
11416649338447677412…46814934786591948801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.283 × 10⁹⁷(98-digit number)
22833298676895354825…93629869573183897601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.566 × 10⁹⁷(98-digit number)
45666597353790709651…87259739146367795201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.133 × 10⁹⁷(98-digit number)
91333194707581419303…74519478292735590401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.826 × 10⁹⁸(99-digit number)
18266638941516283860…49038956585471180801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.653 × 10⁹⁸(99-digit number)
36533277883032567721…98077913170942361601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.306 × 10⁹⁸(99-digit number)
73066555766065135442…96155826341884723201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.461 × 10⁹⁹(100-digit number)
14613311153213027088…92311652683769446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.922 × 10⁹⁹(100-digit number)
29226622306426054177…84623305367538892801
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,754,960 XPM·at block #6,813,860 · 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