Block #2,720,742

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/25/2018, 12:37:30 PM · Difficulty 11.6134 · 4,123,258 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
24b5e16c061a4d8fb6ec4d881e2093c1e245de32a0ecaf358e1e7ec6161f75e4

Height

#2,720,742

Difficulty

11.613427

Transactions

3

Size

800 B

Version

2

Bits

0b9d0994

Nonce

1,223,796,353

Timestamp

6/25/2018, 12:37:30 PM

Confirmations

4,123,258

Merkle Root

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

4.500 × 10⁹⁵(96-digit number)
45006325630284250065…31550946549093921281
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
4.500 × 10⁹⁵(96-digit number)
45006325630284250065…31550946549093921281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.001 × 10⁹⁵(96-digit number)
90012651260568500131…63101893098187842561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.800 × 10⁹⁶(97-digit number)
18002530252113700026…26203786196375685121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.600 × 10⁹⁶(97-digit number)
36005060504227400052…52407572392751370241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.201 × 10⁹⁶(97-digit number)
72010121008454800105…04815144785502740481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.440 × 10⁹⁷(98-digit number)
14402024201690960021…09630289571005480961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.880 × 10⁹⁷(98-digit number)
28804048403381920042…19260579142010961921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.760 × 10⁹⁷(98-digit number)
57608096806763840084…38521158284021923841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.152 × 10⁹⁸(99-digit number)
11521619361352768016…77042316568043847681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.304 × 10⁹⁸(99-digit number)
23043238722705536033…54084633136087695361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.608 × 10⁹⁸(99-digit number)
46086477445411072067…08169266272175390721
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,996,382 XPM·at block #6,843,999 · 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