Block #2,114,107

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/13/2017, 10:33:43 AM · Difficulty 10.8997 · 4,700,374 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
94619822bd265de1669655331088a3b47d29dfc72dec4b2d7c2cf5c3f8f5cab4

Height

#2,114,107

Difficulty

10.899731

Transactions

3

Size

5.08 KB

Version

2

Bits

0ae654c3

Nonce

319,346,122

Timestamp

5/13/2017, 10:33:43 AM

Confirmations

4,700,374

Merkle Root

4fa4f5c0b17a682dc6dae32f6624e880bcdfbbf77ae28f1be0ce722683746565
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.329 × 10⁹⁴(95-digit number)
93293322416401429314…84078861424507256001
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.329 × 10⁹⁴(95-digit number)
93293322416401429314…84078861424507256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.865 × 10⁹⁵(96-digit number)
18658664483280285862…68157722849014512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.731 × 10⁹⁵(96-digit number)
37317328966560571725…36315445698029024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.463 × 10⁹⁵(96-digit number)
74634657933121143451…72630891396058048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.492 × 10⁹⁶(97-digit number)
14926931586624228690…45261782792116096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.985 × 10⁹⁶(97-digit number)
29853863173248457380…90523565584232192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.970 × 10⁹⁶(97-digit number)
59707726346496914761…81047131168464384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.194 × 10⁹⁷(98-digit number)
11941545269299382952…62094262336928768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.388 × 10⁹⁷(98-digit number)
23883090538598765904…24188524673857536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.776 × 10⁹⁷(98-digit number)
47766181077197531809…48377049347715072001
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,759,924 XPM·at block #6,814,480 · 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