Block #2,090,854

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2017, 1:38:12 AM · Difficulty 10.8740 · 4,748,357 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
12e6f2c652e47f16125e109821e2a5b073223b0aa6e1c993017ece7e41ca714f

Height

#2,090,854

Difficulty

10.874021

Transactions

2

Size

1.08 KB

Version

2

Bits

0adfbfdf

Nonce

896,301,038

Timestamp

4/28/2017, 1:38:12 AM

Confirmations

4,748,357

Merkle Root

f6c7d05bb6d492f14cbb75cdf12404d02b327cf192c28004fedbf974475c7ee2
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.

5.778 × 10⁹¹(92-digit number)
57788572675465173823…42391780960783604029
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
5.778 × 10⁹¹(92-digit number)
57788572675465173823…42391780960783604029
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.155 × 10⁹²(93-digit number)
11557714535093034764…84783561921567208059
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.311 × 10⁹²(93-digit number)
23115429070186069529…69567123843134416119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.623 × 10⁹²(93-digit number)
46230858140372139059…39134247686268832239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.246 × 10⁹²(93-digit number)
92461716280744278118…78268495372537664479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.849 × 10⁹³(94-digit number)
18492343256148855623…56536990745075328959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.698 × 10⁹³(94-digit number)
36984686512297711247…13073981490150657919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.396 × 10⁹³(94-digit number)
73969373024595422494…26147962980301315839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.479 × 10⁹⁴(95-digit number)
14793874604919084498…52295925960602631679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.958 × 10⁹⁴(95-digit number)
29587749209838168997…04591851921205263359
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,957,969 XPM·at block #6,839,210 · 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