Block #2,556,058

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/8/2018, 9:51:22 PM · Difficulty 10.9911 · 4,287,565 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9e040ac1287c95eab59a63732cdff28e66a04dfef45b073ec3549b0370134de3

Height

#2,556,058

Difficulty

10.991117

Transactions

39

Size

14.19 KB

Version

2

Bits

0afdb9d9

Nonce

1,984,887,764

Timestamp

3/8/2018, 9:51:22 PM

Confirmations

4,287,565

Merkle Root

dfbf76c144188ab63a6ed067eadc795fd5e2e5af0873f318faa9f04c7d277a50
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.335 × 10⁹⁶(97-digit number)
43352108334818892965…94999297698714941439
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.335 × 10⁹⁶(97-digit number)
43352108334818892965…94999297698714941439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.670 × 10⁹⁶(97-digit number)
86704216669637785931…89998595397429882879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.734 × 10⁹⁷(98-digit number)
17340843333927557186…79997190794859765759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.468 × 10⁹⁷(98-digit number)
34681686667855114372…59994381589719531519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.936 × 10⁹⁷(98-digit number)
69363373335710228745…19988763179439063039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.387 × 10⁹⁸(99-digit number)
13872674667142045749…39977526358878126079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.774 × 10⁹⁸(99-digit number)
27745349334284091498…79955052717756252159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.549 × 10⁹⁸(99-digit number)
55490698668568182996…59910105435512504319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.109 × 10⁹⁹(100-digit number)
11098139733713636599…19820210871025008639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.219 × 10⁹⁹(100-digit number)
22196279467427273198…39640421742050017279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.439 × 10⁹⁹(100-digit number)
44392558934854546396…79280843484100034559
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,993,350 XPM·at block #6,843,622 · 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