Block #900,376

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2015, 6:22:41 PM · Difficulty 10.9427 · 5,908,774 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c23a1e5647841e6b8b20096cccb621516b729aadcbd9bdd7fa9b1adfeaecb99f

Height

#900,376

Difficulty

10.942697

Transactions

17

Size

5.18 KB

Version

2

Bits

0af1548f

Nonce

100,610,728

Timestamp

1/18/2015, 6:22:41 PM

Confirmations

5,908,774

Merkle Root

27bb09c757af6e26b16c7de8a59a5cb4abb210b886b45727c9b2a8e412ef7bb3
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.

3.366 × 10⁹⁷(98-digit number)
33666263447989109812…37656095268619978241
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
3.366 × 10⁹⁷(98-digit number)
33666263447989109812…37656095268619978241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.733 × 10⁹⁷(98-digit number)
67332526895978219624…75312190537239956481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.346 × 10⁹⁸(99-digit number)
13466505379195643924…50624381074479912961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.693 × 10⁹⁸(99-digit number)
26933010758391287849…01248762148959825921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.386 × 10⁹⁸(99-digit number)
53866021516782575699…02497524297919651841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.077 × 10⁹⁹(100-digit number)
10773204303356515139…04995048595839303681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.154 × 10⁹⁹(100-digit number)
21546408606713030279…09990097191678607361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.309 × 10⁹⁹(100-digit number)
43092817213426060559…19980194383357214721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.618 × 10⁹⁹(100-digit number)
86185634426852121119…39960388766714429441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.723 × 10¹⁰⁰(101-digit number)
17237126885370424223…79920777533428858881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.447 × 10¹⁰⁰(101-digit number)
34474253770740848447…59841555066857717761
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,717,263 XPM·at block #6,809,149 · 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