Block #2,643,855

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2018, 6:24:00 AM · Difficulty 11.6955 · 4,187,076 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fd15484fb89c1f264c93c929073ae8c9542374883e0c1ab6e85d1a58b7a3e932

Height

#2,643,855

Difficulty

11.695517

Transactions

10

Size

3.55 KB

Version

2

Bits

0bb20d64

Nonce

15,674,979

Timestamp

5/2/2018, 6:24:00 AM

Confirmations

4,187,076

Merkle Root

7069974d64a683d4b7442aede4d4145308e5827f4e73d36a4fd548bfd5c0efcc
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.

1.923 × 10⁹⁴(95-digit number)
19234253304232805286…19466956195965380081
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
1.923 × 10⁹⁴(95-digit number)
19234253304232805286…19466956195965380081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.846 × 10⁹⁴(95-digit number)
38468506608465610573…38933912391930760161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.693 × 10⁹⁴(95-digit number)
76937013216931221146…77867824783861520321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.538 × 10⁹⁵(96-digit number)
15387402643386244229…55735649567723040641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.077 × 10⁹⁵(96-digit number)
30774805286772488458…11471299135446081281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.154 × 10⁹⁵(96-digit number)
61549610573544976917…22942598270892162561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.230 × 10⁹⁶(97-digit number)
12309922114708995383…45885196541784325121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.461 × 10⁹⁶(97-digit number)
24619844229417990766…91770393083568650241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.923 × 10⁹⁶(97-digit number)
49239688458835981533…83540786167137300481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.847 × 10⁹⁶(97-digit number)
98479376917671963067…67081572334274600961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.969 × 10⁹⁷(98-digit number)
19695875383534392613…34163144668549201921
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,891,581 XPM·at block #6,830,930 · 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