Block #2,959,459

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2018, 4:09:57 AM · Difficulty 11.3549 · 3,879,356 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
be2c9b05d72869d01bc9e1ae23f180d8566fe2ee8d74f964e5cbf5b35e130cbb

Height

#2,959,459

Difficulty

11.354949

Transactions

13

Size

3.54 KB

Version

2

Bits

0b5addf5

Nonce

1,648,770,592

Timestamp

12/10/2018, 4:09:57 AM

Confirmations

3,879,356

Merkle Root

3799df0cab685a7fcfb6cde92ed96b999b64ad018678f79e3919b7b6e17aa56d
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.773 × 10⁹⁴(95-digit number)
47735390827700629235…59809829446737198719
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.773 × 10⁹⁴(95-digit number)
47735390827700629235…59809829446737198719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.547 × 10⁹⁴(95-digit number)
95470781655401258470…19619658893474397439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.909 × 10⁹⁵(96-digit number)
19094156331080251694…39239317786948794879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.818 × 10⁹⁵(96-digit number)
38188312662160503388…78478635573897589759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.637 × 10⁹⁵(96-digit number)
76376625324321006776…56957271147795179519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.527 × 10⁹⁶(97-digit number)
15275325064864201355…13914542295590359039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.055 × 10⁹⁶(97-digit number)
30550650129728402710…27829084591180718079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.110 × 10⁹⁶(97-digit number)
61101300259456805421…55658169182361436159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.222 × 10⁹⁷(98-digit number)
12220260051891361084…11316338364722872319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.444 × 10⁹⁷(98-digit number)
24440520103782722168…22632676729445744639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.888 × 10⁹⁷(98-digit number)
48881040207565444336…45265353458891489279
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,954,785 XPM·at block #6,838,814 · 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