Block #2,648,705

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/4/2018, 4:59:35 PM · Difficulty 11.7665 · 4,182,533 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1f4dcee6e6bb4f16ab99c1d460c84c8138f6b7f8413a656b52241a60570ed501

Height

#2,648,705

Difficulty

11.766532

Transactions

7

Size

2.48 KB

Version

2

Bits

0bc43b76

Nonce

268,072,401

Timestamp

5/4/2018, 4:59:35 PM

Confirmations

4,182,533

Merkle Root

a5e286bfe6f7ca76fbb411ea7cc8ae0baecf8cc8199118caebce9c8a2c72fe53
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.363 × 10⁹⁴(95-digit number)
23637825599278387450…48001008330188490441
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.363 × 10⁹⁴(95-digit number)
23637825599278387450…48001008330188490441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.727 × 10⁹⁴(95-digit number)
47275651198556774900…96002016660376980881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.455 × 10⁹⁴(95-digit number)
94551302397113549800…92004033320753961761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.891 × 10⁹⁵(96-digit number)
18910260479422709960…84008066641507923521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.782 × 10⁹⁵(96-digit number)
37820520958845419920…68016133283015847041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.564 × 10⁹⁵(96-digit number)
75641041917690839840…36032266566031694081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.512 × 10⁹⁶(97-digit number)
15128208383538167968…72064533132063388161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.025 × 10⁹⁶(97-digit number)
30256416767076335936…44129066264126776321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.051 × 10⁹⁶(97-digit number)
60512833534152671872…88258132528253552641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.210 × 10⁹⁷(98-digit number)
12102566706830534374…76516265056507105281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.420 × 10⁹⁷(98-digit number)
24205133413661068748…53032530113014210561
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,894,053 XPM·at block #6,831,237 · 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