Block #2,802,759

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2018, 10:51:30 PM · Difficulty 11.6704 · 4,040,492 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
03b6e30277a325554f4877b996455097960d21373cdb5b5f05548a1bc3b957ca

Height

#2,802,759

Difficulty

11.670394

Transactions

19

Size

5.60 KB

Version

2

Bits

0bab9ef1

Nonce

1,942,882,536

Timestamp

8/20/2018, 10:51:30 PM

Confirmations

4,040,492

Merkle Root

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

7.213 × 10⁹⁶(97-digit number)
72137344959606185529…58615327514820400641
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
7.213 × 10⁹⁶(97-digit number)
72137344959606185529…58615327514820400641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.442 × 10⁹⁷(98-digit number)
14427468991921237105…17230655029640801281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.885 × 10⁹⁷(98-digit number)
28854937983842474211…34461310059281602561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.770 × 10⁹⁷(98-digit number)
57709875967684948423…68922620118563205121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.154 × 10⁹⁸(99-digit number)
11541975193536989684…37845240237126410241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.308 × 10⁹⁸(99-digit number)
23083950387073979369…75690480474252820481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.616 × 10⁹⁸(99-digit number)
46167900774147958739…51380960948505640961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.233 × 10⁹⁸(99-digit number)
92335801548295917478…02761921897011281921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.846 × 10⁹⁹(100-digit number)
18467160309659183495…05523843794022563841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.693 × 10⁹⁹(100-digit number)
36934320619318366991…11047687588045127681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.386 × 10⁹⁹(100-digit number)
73868641238636733982…22095375176090255361
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,990,384 XPM·at block #6,843,250 · 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