Block #2,057,138

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/5/2017, 4:57:21 PM · Difficulty 10.8286 · 4,759,038 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2370d34aa25dbb25a467fb485fd0d0a8aeb0e298130b055c2d64fb4b0d75ba48

Height

#2,057,138

Difficulty

10.828572

Transactions

2

Size

1018 B

Version

2

Bits

0ad41d51

Nonce

1,019,430,963

Timestamp

4/5/2017, 4:57:21 PM

Confirmations

4,759,038

Merkle Root

32f7ff90860bb81abc0e1aa11b4e85626b73ea7dd37a3449aec83344c39a2b48
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.

4.111 × 10⁹⁵(96-digit number)
41113343542911757635…77655144514845775359
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.111 × 10⁹⁵(96-digit number)
41113343542911757635…77655144514845775359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.222 × 10⁹⁵(96-digit number)
82226687085823515271…55310289029691550719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.644 × 10⁹⁶(97-digit number)
16445337417164703054…10620578059383101439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.289 × 10⁹⁶(97-digit number)
32890674834329406108…21241156118766202879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.578 × 10⁹⁶(97-digit number)
65781349668658812217…42482312237532405759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.315 × 10⁹⁷(98-digit number)
13156269933731762443…84964624475064811519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.631 × 10⁹⁷(98-digit number)
26312539867463524886…69929248950129623039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.262 × 10⁹⁷(98-digit number)
52625079734927049773…39858497900259246079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.052 × 10⁹⁸(99-digit number)
10525015946985409954…79716995800518492159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.105 × 10⁹⁸(99-digit number)
21050031893970819909…59433991601036984319
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,773,532 XPM·at block #6,816,175 · 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