Block #1,179,438

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/1/2015, 1:51:14 PM · Difficulty 10.9295 · 5,628,545 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eb1d61c8a7affaac1634bb11cdf84d3f01d93b321f59c0015bd298435413343f

Height

#1,179,438

Difficulty

10.929486

Transactions

16

Size

13.05 KB

Version

2

Bits

0aedf2c8

Nonce

371,554,309

Timestamp

8/1/2015, 1:51:14 PM

Confirmations

5,628,545

Merkle Root

3b961920edf48897aec2b4dc3c579db56bb8e5d08a2eb6e39775f1e7b535e322
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.

4.961 × 10⁹⁴(95-digit number)
49613297662659537900…97165244202681155511
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
4.961 × 10⁹⁴(95-digit number)
49613297662659537900…97165244202681155511
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.922 × 10⁹⁴(95-digit number)
99226595325319075800…94330488405362311021
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.984 × 10⁹⁵(96-digit number)
19845319065063815160…88660976810724622041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.969 × 10⁹⁵(96-digit number)
39690638130127630320…77321953621449244081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.938 × 10⁹⁵(96-digit number)
79381276260255260640…54643907242898488161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.587 × 10⁹⁶(97-digit number)
15876255252051052128…09287814485796976321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.175 × 10⁹⁶(97-digit number)
31752510504102104256…18575628971593952641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.350 × 10⁹⁶(97-digit number)
63505021008204208512…37151257943187905281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.270 × 10⁹⁷(98-digit number)
12701004201640841702…74302515886375810561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.540 × 10⁹⁷(98-digit number)
25402008403281683404…48605031772751621121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.080 × 10⁹⁷(98-digit number)
50804016806563366809…97210063545503242241
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,707,910 XPM·at block #6,807,982 · 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