Block #2,795,752

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/15/2018, 11:11:54 PM · Difficulty 11.6814 · 4,049,150 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
290596a9a3c5eb2ad99c2c6fdb479ce2b5e60f9a99fde29ef4045fdea673978b

Height

#2,795,752

Difficulty

11.681357

Transactions

10

Size

2.93 KB

Version

2

Bits

0bae6d64

Nonce

74,161,830

Timestamp

8/15/2018, 11:11:54 PM

Confirmations

4,049,150

Merkle Root

047b1ab5fca540240ae22b03ef4c3c586eeaedcc19619258e9f3d921bc32a58c
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.

2.462 × 10⁹⁵(96-digit number)
24628158934691668539…08189959882245909761
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
2.462 × 10⁹⁵(96-digit number)
24628158934691668539…08189959882245909761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.925 × 10⁹⁵(96-digit number)
49256317869383337079…16379919764491819521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.851 × 10⁹⁵(96-digit number)
98512635738766674158…32759839528983639041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.970 × 10⁹⁶(97-digit number)
19702527147753334831…65519679057967278081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.940 × 10⁹⁶(97-digit number)
39405054295506669663…31039358115934556161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.881 × 10⁹⁶(97-digit number)
78810108591013339326…62078716231869112321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.576 × 10⁹⁷(98-digit number)
15762021718202667865…24157432463738224641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.152 × 10⁹⁷(98-digit number)
31524043436405335730…48314864927476449281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.304 × 10⁹⁷(98-digit number)
63048086872810671461…96629729854952898561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.260 × 10⁹⁸(99-digit number)
12609617374562134292…93259459709905797121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.521 × 10⁹⁸(99-digit number)
25219234749124268584…86518919419811594241
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:58,003,629 XPM·at block #6,844,901 · 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