Block #2,230,342

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/31/2017, 3:18:09 AM · Difficulty 10.9465 · 4,611,367 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ab326ac599a8a83ecaa0b827d15e5bd77587b75e87bfe5639aff8002297e2298

Height

#2,230,342

Difficulty

10.946471

Transactions

2

Size

1020 B

Version

2

Bits

0af24be9

Nonce

209,289,114

Timestamp

7/31/2017, 3:18:09 AM

Confirmations

4,611,367

Merkle Root

654a42161c5dd77c596219715ff0202035a35041c511dc1165f57da24d420727
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.

9.212 × 10⁹⁶(97-digit number)
92120448677375491377…78055922047610880001
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.212 × 10⁹⁶(97-digit number)
92120448677375491377…78055922047610880001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.842 × 10⁹⁷(98-digit number)
18424089735475098275…56111844095221760001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.684 × 10⁹⁷(98-digit number)
36848179470950196550…12223688190443520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.369 × 10⁹⁷(98-digit number)
73696358941900393101…24447376380887040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.473 × 10⁹⁸(99-digit number)
14739271788380078620…48894752761774080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.947 × 10⁹⁸(99-digit number)
29478543576760157240…97789505523548160001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.895 × 10⁹⁸(99-digit number)
58957087153520314481…95579011047096320001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.179 × 10⁹⁹(100-digit number)
11791417430704062896…91158022094192640001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.358 × 10⁹⁹(100-digit number)
23582834861408125792…82316044188385280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.716 × 10⁹⁹(100-digit number)
47165669722816251585…64632088376770560001
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,978,051 XPM·at block #6,841,708 · 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