Block #2,646,135

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2018, 5:28:36 AM · Difficulty 11.7451 · 4,186,549 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6e0ab83b4965b41c2015d7315ea2856f724c3899c16a6e9983ada62fb278d11e

Height

#2,646,135

Difficulty

11.745141

Transactions

6

Size

1.27 KB

Version

2

Bits

0bbec189

Nonce

1,313,512,061

Timestamp

5/3/2018, 5:28:36 AM

Confirmations

4,186,549

Merkle Root

c9485fb594eb99433f128e890b39019fa3428fb799ee97567fdcd00d61a4f505
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.302 × 10⁹⁴(95-digit number)
83024772491847492366…04943533452585734081
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.302 × 10⁹⁴(95-digit number)
83024772491847492366…04943533452585734081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.660 × 10⁹⁵(96-digit number)
16604954498369498473…09887066905171468161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.320 × 10⁹⁵(96-digit number)
33209908996738996946…19774133810342936321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.641 × 10⁹⁵(96-digit number)
66419817993477993892…39548267620685872641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.328 × 10⁹⁶(97-digit number)
13283963598695598778…79096535241371745281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.656 × 10⁹⁶(97-digit number)
26567927197391197557…58193070482743490561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.313 × 10⁹⁶(97-digit number)
53135854394782395114…16386140965486981121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.062 × 10⁹⁷(98-digit number)
10627170878956479022…32772281930973962241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.125 × 10⁹⁷(98-digit number)
21254341757912958045…65544563861947924481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.250 × 10⁹⁷(98-digit number)
42508683515825916091…31089127723895848961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.501 × 10⁹⁷(98-digit number)
85017367031651832182…62178255447791697921
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,905,627 XPM·at block #6,832,683 · 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