Block #2,792,363

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/13/2018, 4:22:18 PM · Difficulty 11.6750 · 4,046,435 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
60219f281c3acd23be6a07f1b233aac09ed1665360c2f967c06fc047205aafcc

Height

#2,792,363

Difficulty

11.675011

Transactions

3

Size

12.20 KB

Version

2

Bits

0baccd81

Nonce

1,416,659,744

Timestamp

8/13/2018, 4:22:18 PM

Confirmations

4,046,435

Merkle Root

580687a0e822d7b73fa7416d13c1adf6f52cec12c3310f627969ad59b4886a85
Transactions (3)
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.

5.817 × 10⁹⁵(96-digit number)
58173571442027069897…16807857456412380161
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
5.817 × 10⁹⁵(96-digit number)
58173571442027069897…16807857456412380161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.163 × 10⁹⁶(97-digit number)
11634714288405413979…33615714912824760321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.326 × 10⁹⁶(97-digit number)
23269428576810827958…67231429825649520641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.653 × 10⁹⁶(97-digit number)
46538857153621655917…34462859651299041281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.307 × 10⁹⁶(97-digit number)
93077714307243311835…68925719302598082561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.861 × 10⁹⁷(98-digit number)
18615542861448662367…37851438605196165121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.723 × 10⁹⁷(98-digit number)
37231085722897324734…75702877210392330241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.446 × 10⁹⁷(98-digit number)
74462171445794649468…51405754420784660481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.489 × 10⁹⁸(99-digit number)
14892434289158929893…02811508841569320961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.978 × 10⁹⁸(99-digit number)
29784868578317859787…05623017683138641921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.956 × 10⁹⁸(99-digit number)
59569737156635719574…11246035366277283841
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,954,648 XPM·at block #6,838,797 · 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