Block #2,726,096

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/29/2018, 3:39:14 AM · Difficulty 11.6236 · 4,117,025 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
732d9786d529c57e0e2f58539b8d4ab027a32c82eb350dd16130493825a6df8d

Height

#2,726,096

Difficulty

11.623602

Transactions

33

Size

8.91 KB

Version

2

Bits

0b9fa469

Nonce

132,072,652

Timestamp

6/29/2018, 3:39:14 AM

Confirmations

4,117,025

Merkle Root

b82e4cd3fb5a7561c99cbec634ad4601e332c75f97bcc522c0b2c7abf2b49a45
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.062 × 10⁹⁵(96-digit number)
10625567552949624270…35420892394833489921
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.062 × 10⁹⁵(96-digit number)
10625567552949624270…35420892394833489921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.125 × 10⁹⁵(96-digit number)
21251135105899248540…70841784789666979841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.250 × 10⁹⁵(96-digit number)
42502270211798497081…41683569579333959681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.500 × 10⁹⁵(96-digit number)
85004540423596994162…83367139158667919361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.700 × 10⁹⁶(97-digit number)
17000908084719398832…66734278317335838721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.400 × 10⁹⁶(97-digit number)
34001816169438797665…33468556634671677441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.800 × 10⁹⁶(97-digit number)
68003632338877595330…66937113269343354881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.360 × 10⁹⁷(98-digit number)
13600726467775519066…33874226538686709761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.720 × 10⁹⁷(98-digit number)
27201452935551038132…67748453077373419521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.440 × 10⁹⁷(98-digit number)
54402905871102076264…35496906154746839041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.088 × 10⁹⁸(99-digit number)
10880581174220415252…70993812309493678081
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,989,333 XPM·at block #6,843,120 · 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