Block #2,874,932

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/10/2018, 4:59:54 AM · Difficulty 11.6602 · 3,956,738 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9e717978768627f72750dfee38ac75948b76e3f4635c1e8ade12b0b5ee798478

Height

#2,874,932

Difficulty

11.660191

Transactions

5

Size

1.27 KB

Version

2

Bits

0ba90245

Nonce

257,857,700

Timestamp

10/10/2018, 4:59:54 AM

Confirmations

3,956,738

Merkle Root

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

5.112 × 10⁹³(94-digit number)
51127614433094347621…67196745088729104641
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
5.112 × 10⁹³(94-digit number)
51127614433094347621…67196745088729104641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.022 × 10⁹⁴(95-digit number)
10225522886618869524…34393490177458209281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.045 × 10⁹⁴(95-digit number)
20451045773237739048…68786980354916418561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.090 × 10⁹⁴(95-digit number)
40902091546475478097…37573960709832837121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.180 × 10⁹⁴(95-digit number)
81804183092950956194…75147921419665674241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.636 × 10⁹⁵(96-digit number)
16360836618590191238…50295842839331348481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.272 × 10⁹⁵(96-digit number)
32721673237180382477…00591685678662696961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.544 × 10⁹⁵(96-digit number)
65443346474360764955…01183371357325393921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.308 × 10⁹⁶(97-digit number)
13088669294872152991…02366742714650787841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.617 × 10⁹⁶(97-digit number)
26177338589744305982…04733485429301575681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.235 × 10⁹⁶(97-digit number)
52354677179488611964…09466970858603151361
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,897,465 XPM·at block #6,831,669 · 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