Block #2,941,176

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/27/2018, 8:15:11 AM · Difficulty 11.3785 · 3,899,762 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
225c9d8d0465ad66e63356451863cbd4956ead3e0256f0dd290b299947209ed3

Height

#2,941,176

Difficulty

11.378459

Transactions

5

Size

1.67 KB

Version

2

Bits

0b60e2b4

Nonce

73,270,048

Timestamp

11/27/2018, 8:15:11 AM

Confirmations

3,899,762

Merkle Root

cbb9c9a89ef78f33cf8e1b8fe547c5a08305305bbd8ac21c6468fd1a6be9d4db
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.174 × 10⁹⁵(96-digit number)
81746035359506392826…25290080495203575041
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.174 × 10⁹⁵(96-digit number)
81746035359506392826…25290080495203575041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.634 × 10⁹⁶(97-digit number)
16349207071901278565…50580160990407150081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.269 × 10⁹⁶(97-digit number)
32698414143802557130…01160321980814300161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.539 × 10⁹⁶(97-digit number)
65396828287605114261…02320643961628600321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.307 × 10⁹⁷(98-digit number)
13079365657521022852…04641287923257200641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.615 × 10⁹⁷(98-digit number)
26158731315042045704…09282575846514401281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.231 × 10⁹⁷(98-digit number)
52317462630084091409…18565151693028802561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.046 × 10⁹⁸(99-digit number)
10463492526016818281…37130303386057605121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.092 × 10⁹⁸(99-digit number)
20926985052033636563…74260606772115210241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.185 × 10⁹⁸(99-digit number)
41853970104067273127…48521213544230420481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.370 × 10⁹⁸(99-digit number)
83707940208134546254…97042427088460840961
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,971,858 XPM·at block #6,840,937 · 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