Block #2,118,583

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/16/2017, 5:17:32 AM · Difficulty 10.9088 · 4,719,992 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
aa6656d79bcc6f6dd7812425635c92c7a3f2db4faeec57486fee5d23a633ff1a

Height

#2,118,583

Difficulty

10.908842

Transactions

2

Size

1.28 KB

Version

2

Bits

0ae8a9dc

Nonce

1,916,764,599

Timestamp

5/16/2017, 5:17:32 AM

Confirmations

4,719,992

Merkle Root

ee9c474b566232f03cf5428ca83adf1b225244200a409206d89c426e3fae64f4
Transactions (2)
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.

1.039 × 10⁹³(94-digit number)
10397608041638068879…85027748145900689279
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
1.039 × 10⁹³(94-digit number)
10397608041638068879…85027748145900689279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.079 × 10⁹³(94-digit number)
20795216083276137758…70055496291801378559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.159 × 10⁹³(94-digit number)
41590432166552275517…40110992583602757119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.318 × 10⁹³(94-digit number)
83180864333104551035…80221985167205514239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.663 × 10⁹⁴(95-digit number)
16636172866620910207…60443970334411028479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.327 × 10⁹⁴(95-digit number)
33272345733241820414…20887940668822056959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.654 × 10⁹⁴(95-digit number)
66544691466483640828…41775881337644113919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.330 × 10⁹⁵(96-digit number)
13308938293296728165…83551762675288227839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.661 × 10⁹⁵(96-digit number)
26617876586593456331…67103525350576455679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.323 × 10⁹⁵(96-digit number)
53235753173186912662…34207050701152911359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.064 × 10⁹⁶(97-digit number)
10647150634637382532…68414101402305822719
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,952,886 XPM·at block #6,838,574 · 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