Block #2,099,702

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/4/2017, 4:21:57 PM · Difficulty 10.8563 · 4,742,136 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8539540a1c2ac15e548f3956855d3a061c72740e35a66b1cd1ac48d5794629a8

Height

#2,099,702

Difficulty

10.856281

Transactions

3

Size

993 B

Version

2

Bits

0adb3543

Nonce

72,021,827

Timestamp

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

Confirmations

4,742,136

Merkle Root

b63cc9c2b6ccf9e6fdc5068168457ff5457da9bf653d39063f9a8b8b8805387a
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.027 × 10⁹⁴(95-digit number)
40271734025759399047…12481038184691464001
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.027 × 10⁹⁴(95-digit number)
40271734025759399047…12481038184691464001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.054 × 10⁹⁴(95-digit number)
80543468051518798095…24962076369382928001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.610 × 10⁹⁵(96-digit number)
16108693610303759619…49924152738765856001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.221 × 10⁹⁵(96-digit number)
32217387220607519238…99848305477531712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.443 × 10⁹⁵(96-digit number)
64434774441215038476…99696610955063424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.288 × 10⁹⁶(97-digit number)
12886954888243007695…99393221910126848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.577 × 10⁹⁶(97-digit number)
25773909776486015390…98786443820253696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.154 × 10⁹⁶(97-digit number)
51547819552972030781…97572887640507392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.030 × 10⁹⁷(98-digit number)
10309563910594406156…95145775281014784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.061 × 10⁹⁷(98-digit number)
20619127821188812312…90291550562029568001
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,979,078 XPM·at block #6,841,837 · 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