Block #910,790

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/26/2015, 2:08:23 PM · Difficulty 10.9325 · 5,897,418 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9f5a872aca8006a32a868b879159fe97f61b07d4e33f2f6225ba77d7029c7daf

Height

#910,790

Difficulty

10.932503

Transactions

4

Size

1.87 KB

Version

2

Bits

0aeeb884

Nonce

285,022,549

Timestamp

1/26/2015, 2:08:23 PM

Confirmations

5,897,418

Merkle Root

543556c4a76fd65c9ce637c40b037c6950c5ec69b1b198740e841a0fb9c25810
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.871 × 10⁹⁶(97-digit number)
18714848948564379126…54648737079869472961
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.871 × 10⁹⁶(97-digit number)
18714848948564379126…54648737079869472961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.742 × 10⁹⁶(97-digit number)
37429697897128758252…09297474159738945921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.485 × 10⁹⁶(97-digit number)
74859395794257516505…18594948319477891841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.497 × 10⁹⁷(98-digit number)
14971879158851503301…37189896638955783681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.994 × 10⁹⁷(98-digit number)
29943758317703006602…74379793277911567361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.988 × 10⁹⁷(98-digit number)
59887516635406013204…48759586555823134721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.197 × 10⁹⁸(99-digit number)
11977503327081202640…97519173111646269441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.395 × 10⁹⁸(99-digit number)
23955006654162405281…95038346223292538881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.791 × 10⁹⁸(99-digit number)
47910013308324810563…90076692446585077761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.582 × 10⁹⁸(99-digit number)
95820026616649621127…80153384893170155521
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,709,714 XPM·at block #6,808,207 · 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