Block #2,721,773

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/26/2018, 5:33:13 AM · Difficulty 11.6145 · 4,120,539 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1ac15f8019748bebfce028fabd044b146d4db53af70f9e69125ce6be4b456ea8

Height

#2,721,773

Difficulty

11.614518

Transactions

10

Size

2.46 KB

Version

2

Bits

0b9d5110

Nonce

700,505,323

Timestamp

6/26/2018, 5:33:13 AM

Confirmations

4,120,539

Merkle Root

d480ea16ccb75dcffbab57dc1c97aa639ac4ba39f452377fabef9076742d92e6
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.499 × 10⁹⁷(98-digit number)
14991233862523621287…32706426886556385281
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.499 × 10⁹⁷(98-digit number)
14991233862523621287…32706426886556385281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.998 × 10⁹⁷(98-digit number)
29982467725047242575…65412853773112770561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.996 × 10⁹⁷(98-digit number)
59964935450094485150…30825707546225541121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.199 × 10⁹⁸(99-digit number)
11992987090018897030…61651415092451082241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.398 × 10⁹⁸(99-digit number)
23985974180037794060…23302830184902164481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.797 × 10⁹⁸(99-digit number)
47971948360075588120…46605660369804328961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.594 × 10⁹⁸(99-digit number)
95943896720151176240…93211320739608657921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.918 × 10⁹⁹(100-digit number)
19188779344030235248…86422641479217315841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.837 × 10⁹⁹(100-digit number)
38377558688060470496…72845282958434631681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.675 × 10⁹⁹(100-digit number)
76755117376120940992…45690565916869263361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.535 × 10¹⁰⁰(101-digit number)
15351023475224188198…91381131833738526721
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,982,903 XPM·at block #6,842,311 · 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