Block #2,752,342

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/17/2018, 3:22:31 AM · Difficulty 11.6491 · 4,090,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
de4dc27092bb2930cec90a0328cce0fe35e9cd22379dd2b3071ee7452a3d0427

Height

#2,752,342

Difficulty

11.649134

Transactions

2

Size

425 B

Version

2

Bits

0ba62d9f

Nonce

1,089,610,395

Timestamp

7/17/2018, 3:22:31 AM

Confirmations

4,090,447

Merkle Root

8b0197e1b4993b8b8ac2f2357c63a9f2a98c76e929ba6e4de6171668a76fd5f3
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.

8.981 × 10⁹⁴(95-digit number)
89812394796006122225…41285812446319692001
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
8.981 × 10⁹⁴(95-digit number)
89812394796006122225…41285812446319692001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.796 × 10⁹⁵(96-digit number)
17962478959201224445…82571624892639384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.592 × 10⁹⁵(96-digit number)
35924957918402448890…65143249785278768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.184 × 10⁹⁵(96-digit number)
71849915836804897780…30286499570557536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.436 × 10⁹⁶(97-digit number)
14369983167360979556…60572999141115072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.873 × 10⁹⁶(97-digit number)
28739966334721959112…21145998282230144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.747 × 10⁹⁶(97-digit number)
57479932669443918224…42291996564460288001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.149 × 10⁹⁷(98-digit number)
11495986533888783644…84583993128920576001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.299 × 10⁹⁷(98-digit number)
22991973067777567289…69167986257841152001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.598 × 10⁹⁷(98-digit number)
45983946135555134579…38335972515682304001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.196 × 10⁹⁷(98-digit number)
91967892271110269159…76671945031364608001
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,986,650 XPM·at block #6,842,788 · 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