Block #2,745,193

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/12/2018, 4:41:15 AM · Difficulty 11.6470 · 4,094,589 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f1facd1b1ab15a474f73d7795829b651f2772545544c56fec59ac8c5353117fb

Height

#2,745,193

Difficulty

11.647044

Transactions

13

Size

4.23 KB

Version

2

Bits

0ba5a4ad

Nonce

563,052,078

Timestamp

7/12/2018, 4:41:15 AM

Confirmations

4,094,589

Merkle Root

203f02bc450cb95e47e60921e60a94a75c3c4b5f831861273b3a161b9ae4693b
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.

1.731 × 10⁹⁵(96-digit number)
17312349738207111776…26409858929445301121
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
1.731 × 10⁹⁵(96-digit number)
17312349738207111776…26409858929445301121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.462 × 10⁹⁵(96-digit number)
34624699476414223552…52819717858890602241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.924 × 10⁹⁵(96-digit number)
69249398952828447104…05639435717781204481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.384 × 10⁹⁶(97-digit number)
13849879790565689420…11278871435562408961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.769 × 10⁹⁶(97-digit number)
27699759581131378841…22557742871124817921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.539 × 10⁹⁶(97-digit number)
55399519162262757683…45115485742249635841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.107 × 10⁹⁷(98-digit number)
11079903832452551536…90230971484499271681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.215 × 10⁹⁷(98-digit number)
22159807664905103073…80461942968998543361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.431 × 10⁹⁷(98-digit number)
44319615329810206147…60923885937997086721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.863 × 10⁹⁷(98-digit number)
88639230659620412294…21847771875994173441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.772 × 10⁹⁸(99-digit number)
17727846131924082458…43695543751988346881
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,962,546 XPM·at block #6,839,781 · 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