Block #2,643,185

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 12:23:29 AM · Difficulty 11.6762 · 4,190,280 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
103c36caa9cff7a2b5cc593966e48c5cbd611b2b3bcb13764db702c4e2173d61

Height

#2,643,185

Difficulty

11.676208

Transactions

8

Size

2.63 KB

Version

2

Bits

0bad1bf7

Nonce

1,447,630,029

Timestamp

5/2/2018, 12:23:29 AM

Confirmations

4,190,280

Merkle Root

8168f40a67e9bfbf5bde17c1b59471d9c82e869dfce57d6f9302ccedb8bed9f8
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.785 × 10⁹¹(92-digit number)
47859196819895660452…04234336220920295301
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.785 × 10⁹¹(92-digit number)
47859196819895660452…04234336220920295301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.571 × 10⁹¹(92-digit number)
95718393639791320905…08468672441840590601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.914 × 10⁹²(93-digit number)
19143678727958264181…16937344883681181201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.828 × 10⁹²(93-digit number)
38287357455916528362…33874689767362362401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.657 × 10⁹²(93-digit number)
76574714911833056724…67749379534724724801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.531 × 10⁹³(94-digit number)
15314942982366611344…35498759069449449601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.062 × 10⁹³(94-digit number)
30629885964733222689…70997518138898899201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.125 × 10⁹³(94-digit number)
61259771929466445379…41995036277797798401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.225 × 10⁹⁴(95-digit number)
12251954385893289075…83990072555595596801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.450 × 10⁹⁴(95-digit number)
24503908771786578151…67980145111191193601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.900 × 10⁹⁴(95-digit number)
49007817543573156303…35960290222382387201
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,911,921 XPM·at block #6,833,464 · 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