Block #2,646,361

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2018, 8:03:54 AM · Difficulty 11.7487 · 4,184,881 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0058d5b0d3020de0348d1a00208d1a01825fe67f0651319718850f7a7e3a552e

Height

#2,646,361

Difficulty

11.748711

Transactions

7

Size

2.67 KB

Version

2

Bits

0bbfab80

Nonce

1,407,776,790

Timestamp

5/3/2018, 8:03:54 AM

Confirmations

4,184,881

Merkle Root

1aec17d6f9f4b431b12908c01a18f9abadd91eb62778cd6745708f731f2bae90
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.

4.009 × 10⁹³(94-digit number)
40093186630922154974…63824238004158569221
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
4.009 × 10⁹³(94-digit number)
40093186630922154974…63824238004158569221
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.018 × 10⁹³(94-digit number)
80186373261844309948…27648476008317138441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.603 × 10⁹⁴(95-digit number)
16037274652368861989…55296952016634276881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.207 × 10⁹⁴(95-digit number)
32074549304737723979…10593904033268553761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.414 × 10⁹⁴(95-digit number)
64149098609475447959…21187808066537107521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.282 × 10⁹⁵(96-digit number)
12829819721895089591…42375616133074215041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.565 × 10⁹⁵(96-digit number)
25659639443790179183…84751232266148430081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.131 × 10⁹⁵(96-digit number)
51319278887580358367…69502464532296860161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.026 × 10⁹⁶(97-digit number)
10263855777516071673…39004929064593720321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.052 × 10⁹⁶(97-digit number)
20527711555032143346…78009858129187440641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.105 × 10⁹⁶(97-digit number)
41055423110064286693…56019716258374881281
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,086 XPM·at block #6,831,241 · 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