Block #2,640,199

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2018, 10:15:04 PM · Difficulty 11.5710 · 4,191,093 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ac976f6681e0e4e834ac6484544561597f444d224f85b6e6153cd3456d6570ad

Height

#2,640,199

Difficulty

11.570969

Transactions

7

Size

1.78 KB

Version

2

Bits

0b922b0a

Nonce

510,299,652

Timestamp

4/30/2018, 10:15:04 PM

Confirmations

4,191,093

Merkle Root

3c0ab940d9a4a8e478af37212f15ec536f6feb3f906b0dde12665e1bdcd2a53f
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.

8.221 × 10⁹⁵(96-digit number)
82217943310064398186…33435175161997216001
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
8.221 × 10⁹⁵(96-digit number)
82217943310064398186…33435175161997216001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.644 × 10⁹⁶(97-digit number)
16443588662012879637…66870350323994432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.288 × 10⁹⁶(97-digit number)
32887177324025759274…33740700647988864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.577 × 10⁹⁶(97-digit number)
65774354648051518549…67481401295977728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.315 × 10⁹⁷(98-digit number)
13154870929610303709…34962802591955456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.630 × 10⁹⁷(98-digit number)
26309741859220607419…69925605183910912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.261 × 10⁹⁷(98-digit number)
52619483718441214839…39851210367821824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.052 × 10⁹⁸(99-digit number)
10523896743688242967…79702420735643648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.104 × 10⁹⁸(99-digit number)
21047793487376485935…59404841471287296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.209 × 10⁹⁸(99-digit number)
42095586974752971871…18809682942574592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.419 × 10⁹⁸(99-digit number)
84191173949505943742…37619365885149184001
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,482 XPM·at block #6,831,291 · 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