Block #2,038,724

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/26/2017, 1:34:24 AM · Difficulty 10.6806 · 4,803,185 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
17aced4ca4387508590c30d792536f0c2db81a3fdca91a820b98125eb52dcfce

Height

#2,038,724

Difficulty

10.680601

Transactions

1

Size

243 B

Version

2

Bits

0aae3bd9

Nonce

1,659,163,164

Timestamp

3/26/2017, 1:34:24 AM

Confirmations

4,803,185

Merkle Root

15a33ade45f6a4f939d1b762fa36558b13fd22325b2c18e29accab526784f35f
Transactions (1)
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.

9.222 × 10⁹⁶(97-digit number)
92225364979501591922…05468982876799231999
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
9.222 × 10⁹⁶(97-digit number)
92225364979501591922…05468982876799231999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.844 × 10⁹⁷(98-digit number)
18445072995900318384…10937965753598463999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.689 × 10⁹⁷(98-digit number)
36890145991800636768…21875931507196927999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.378 × 10⁹⁷(98-digit number)
73780291983601273537…43751863014393855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.475 × 10⁹⁸(99-digit number)
14756058396720254707…87503726028787711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.951 × 10⁹⁸(99-digit number)
29512116793440509415…75007452057575423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.902 × 10⁹⁸(99-digit number)
59024233586881018830…50014904115150847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.180 × 10⁹⁹(100-digit number)
11804846717376203766…00029808230301695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.360 × 10⁹⁹(100-digit number)
23609693434752407532…00059616460603391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.721 × 10⁹⁹(100-digit number)
47219386869504815064…00119232921206783999
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,979,647 XPM·at block #6,841,908 · 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