Block #2,479,182

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/18/2018, 6:34:35 PM · Difficulty 10.9659 · 4,363,061 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
34a2b510fa82feedc374d0c7bf61476b2ff593863da5b5687540cdb3bff759d7

Height

#2,479,182

Difficulty

10.965865

Transactions

4

Size

2.91 KB

Version

2

Bits

0af742ef

Nonce

210,878,056

Timestamp

1/18/2018, 6:34:35 PM

Confirmations

4,363,061

Merkle Root

24e94a789693326b08c0180904f907d91c96d18e9210cf96c25811291d8ab186
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.

7.803 × 10⁹³(94-digit number)
78036245031999540487…80252079522799959801
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
7.803 × 10⁹³(94-digit number)
78036245031999540487…80252079522799959801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.560 × 10⁹⁴(95-digit number)
15607249006399908097…60504159045599919601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.121 × 10⁹⁴(95-digit number)
31214498012799816194…21008318091199839201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.242 × 10⁹⁴(95-digit number)
62428996025599632389…42016636182399678401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.248 × 10⁹⁵(96-digit number)
12485799205119926477…84033272364799356801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.497 × 10⁹⁵(96-digit number)
24971598410239852955…68066544729598713601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.994 × 10⁹⁵(96-digit number)
49943196820479705911…36133089459197427201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.988 × 10⁹⁵(96-digit number)
99886393640959411823…72266178918394854401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.997 × 10⁹⁶(97-digit number)
19977278728191882364…44532357836789708801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.995 × 10⁹⁶(97-digit number)
39954557456383764729…89064715673579417601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.990 × 10⁹⁶(97-digit number)
79909114912767529458…78129431347158835201
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,982,342 XPM·at block #6,842,242 · 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