Block #2,297,738

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/16/2017, 3:05:49 AM · Difficulty 10.9458 · 4,517,075 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c5c001cac177aed38bf1da149087ac04852c7c1be1c8cbdc987080932f202d02

Height

#2,297,738

Difficulty

10.945848

Transactions

5

Size

1.19 KB

Version

2

Bits

0af22320

Nonce

567,304,877

Timestamp

9/16/2017, 3:05:49 AM

Confirmations

4,517,075

Merkle Root

f18bd7d81c940b462a2c431e1cd92bd0fe47a199e82253b432d62660d5801736
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.

3.748 × 10⁹⁴(95-digit number)
37485347633431603803…86963098226372038561
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
3.748 × 10⁹⁴(95-digit number)
37485347633431603803…86963098226372038561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.497 × 10⁹⁴(95-digit number)
74970695266863207606…73926196452744077121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.499 × 10⁹⁵(96-digit number)
14994139053372641521…47852392905488154241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.998 × 10⁹⁵(96-digit number)
29988278106745283042…95704785810976308481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.997 × 10⁹⁵(96-digit number)
59976556213490566085…91409571621952616961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.199 × 10⁹⁶(97-digit number)
11995311242698113217…82819143243905233921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.399 × 10⁹⁶(97-digit number)
23990622485396226434…65638286487810467841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.798 × 10⁹⁶(97-digit number)
47981244970792452868…31276572975620935681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.596 × 10⁹⁶(97-digit number)
95962489941584905736…62553145951241871361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.919 × 10⁹⁷(98-digit number)
19192497988316981147…25106291902483742721
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,762,590 XPM·at block #6,814,812 · 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