Block #2,099,977

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/4/2017, 9:21:42 PM · Difficulty 10.8556 · 4,742,360 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2d5f8df265ace238c6e4badc0cf540c399a6f62ebe2900950b1ce23f48c80bc9

Height

#2,099,977

Difficulty

10.855603

Transactions

2

Size

871 B

Version

2

Bits

0adb08c6

Nonce

649,552,309

Timestamp

5/4/2017, 9:21:42 PM

Confirmations

4,742,360

Merkle Root

5b6d01e9ff6c8f9de87081a34cb518e409bddb55986a56afb9861cfcde10ecd9
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.024 × 10⁹⁶(97-digit number)
10246973618456249760…96108969141717094399
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.024 × 10⁹⁶(97-digit number)
10246973618456249760…96108969141717094399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.049 × 10⁹⁶(97-digit number)
20493947236912499521…92217938283434188799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.098 × 10⁹⁶(97-digit number)
40987894473824999042…84435876566868377599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.197 × 10⁹⁶(97-digit number)
81975788947649998085…68871753133736755199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.639 × 10⁹⁷(98-digit number)
16395157789529999617…37743506267473510399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.279 × 10⁹⁷(98-digit number)
32790315579059999234…75487012534947020799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.558 × 10⁹⁷(98-digit number)
65580631158119998468…50974025069894041599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.311 × 10⁹⁸(99-digit number)
13116126231623999693…01948050139788083199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.623 × 10⁹⁸(99-digit number)
26232252463247999387…03896100279576166399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.246 × 10⁹⁸(99-digit number)
52464504926495998774…07792200559152332799
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,983,103 XPM·at block #6,842,336 · 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