Block #2,593,928

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/31/2018, 11:54:41 AM · Difficulty 11.3007 · 4,237,447 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f03c7d92be2b9f4f48b4c0a8739ef8c5f62d410e916f14f9063c01852f85330b

Height

#2,593,928

Difficulty

11.300663

Transactions

49

Size

13.87 KB

Version

2

Bits

0b4cf83e

Nonce

672,582,537

Timestamp

3/31/2018, 11:54:41 AM

Confirmations

4,237,447

Merkle Root

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

6.658 × 10⁹⁶(97-digit number)
66588946349095314884…21055402201749690881
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
6.658 × 10⁹⁶(97-digit number)
66588946349095314884…21055402201749690881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.331 × 10⁹⁷(98-digit number)
13317789269819062976…42110804403499381761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.663 × 10⁹⁷(98-digit number)
26635578539638125953…84221608806998763521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.327 × 10⁹⁷(98-digit number)
53271157079276251907…68443217613997527041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.065 × 10⁹⁸(99-digit number)
10654231415855250381…36886435227995054081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.130 × 10⁹⁸(99-digit number)
21308462831710500763…73772870455990108161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.261 × 10⁹⁸(99-digit number)
42616925663421001526…47545740911980216321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.523 × 10⁹⁸(99-digit number)
85233851326842003052…95091481823960432641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.704 × 10⁹⁹(100-digit number)
17046770265368400610…90182963647920865281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.409 × 10⁹⁹(100-digit number)
34093540530736801220…80365927295841730561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.818 × 10⁹⁹(100-digit number)
68187081061473602441…60731854591683461121
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,895,157 XPM·at block #6,831,374 · 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