Block #2,876,853

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/11/2018, 3:18:40 PM · Difficulty 11.6508 · 3,968,476 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
77f1e3a334667e5c6358b05c76e6fbd026eacc3b27dba4ac09772d0af7017d73

Height

#2,876,853

Difficulty

11.650801

Transactions

6

Size

2.33 KB

Version

2

Bits

0ba69ae8

Nonce

4,718,480

Timestamp

10/11/2018, 3:18:40 PM

Confirmations

3,968,476

Merkle Root

8024368b024fb732c5197741c14df2bac8a95d2461142040d231a31b79f7dd2e
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.

7.616 × 10⁹³(94-digit number)
76168872343343375486…38368190401698418151
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
7.616 × 10⁹³(94-digit number)
76168872343343375486…38368190401698418151
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.523 × 10⁹⁴(95-digit number)
15233774468668675097…76736380803396836301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.046 × 10⁹⁴(95-digit number)
30467548937337350194…53472761606793672601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.093 × 10⁹⁴(95-digit number)
60935097874674700389…06945523213587345201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.218 × 10⁹⁵(96-digit number)
12187019574934940077…13891046427174690401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.437 × 10⁹⁵(96-digit number)
24374039149869880155…27782092854349380801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.874 × 10⁹⁵(96-digit number)
48748078299739760311…55564185708698761601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.749 × 10⁹⁵(96-digit number)
97496156599479520622…11128371417397523201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.949 × 10⁹⁶(97-digit number)
19499231319895904124…22256742834795046401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.899 × 10⁹⁶(97-digit number)
38998462639791808249…44513485669590092801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.799 × 10⁹⁶(97-digit number)
77996925279583616498…89026971339180185601
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:58,007,064 XPM·at block #6,845,327 · 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