Block #2,723,371

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/27/2018, 7:04:47 AM · Difficulty 11.6196 · 4,119,277 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0b3d6f72ff670642cb9d6c0e6cfef2acf87c5730baffb05d49fe73f0f2cd4d85

Height

#2,723,371

Difficulty

11.619636

Transactions

12

Size

3.13 KB

Version

2

Bits

0b9ea07c

Nonce

877,993,818

Timestamp

6/27/2018, 7:04:47 AM

Confirmations

4,119,277

Merkle Root

648d28c33f391b733e72e2df61c836af40dd75798c8a0c9449618ad534f68734
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.850 × 10⁹⁵(96-digit number)
48502090866142796438…02641386486913446401
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.850 × 10⁹⁵(96-digit number)
48502090866142796438…02641386486913446401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.700 × 10⁹⁵(96-digit number)
97004181732285592876…05282772973826892801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.940 × 10⁹⁶(97-digit number)
19400836346457118575…10565545947653785601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.880 × 10⁹⁶(97-digit number)
38801672692914237150…21131091895307571201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.760 × 10⁹⁶(97-digit number)
77603345385828474301…42262183790615142401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.552 × 10⁹⁷(98-digit number)
15520669077165694860…84524367581230284801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.104 × 10⁹⁷(98-digit number)
31041338154331389720…69048735162460569601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.208 × 10⁹⁷(98-digit number)
62082676308662779441…38097470324921139201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.241 × 10⁹⁸(99-digit number)
12416535261732555888…76194940649842278401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.483 × 10⁹⁸(99-digit number)
24833070523465111776…52389881299684556801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.966 × 10⁹⁸(99-digit number)
49666141046930223552…04779762599369113601
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,985,618 XPM·at block #6,842,647 · 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