Block #2,787,531

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/10/2018, 7:43:13 AM · Difficulty 11.6752 · 4,054,024 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f6e3754bdfed3869206585aa06f8def2590840c3eb44a484d013d2cb3b922400

Height

#2,787,531

Difficulty

11.675239

Transactions

2

Size

1.15 KB

Version

2

Bits

0bacdc77

Nonce

169,310,416

Timestamp

8/10/2018, 7:43:13 AM

Confirmations

4,054,024

Merkle Root

6065b85975e3882a6929f495b271448c81cc8e73bfdea4252ee5d2900e009b38
Transactions (2)
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.328 × 10⁹⁴(95-digit number)
53283107271393990036…46554790331146470081
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.328 × 10⁹⁴(95-digit number)
53283107271393990036…46554790331146470081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.065 × 10⁹⁵(96-digit number)
10656621454278798007…93109580662292940161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.131 × 10⁹⁵(96-digit number)
21313242908557596014…86219161324585880321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.262 × 10⁹⁵(96-digit number)
42626485817115192029…72438322649171760641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.525 × 10⁹⁵(96-digit number)
85252971634230384058…44876645298343521281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.705 × 10⁹⁶(97-digit number)
17050594326846076811…89753290596687042561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.410 × 10⁹⁶(97-digit number)
34101188653692153623…79506581193374085121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.820 × 10⁹⁶(97-digit number)
68202377307384307246…59013162386748170241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.364 × 10⁹⁷(98-digit number)
13640475461476861449…18026324773496340481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.728 × 10⁹⁷(98-digit number)
27280950922953722898…36052649546992680961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.456 × 10⁹⁷(98-digit number)
54561901845907445797…72105299093985361921
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,976,825 XPM·at block #6,841,554 · 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