Block #2,861,277

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/30/2018, 1:48:34 PM · Difficulty 11.6741 · 3,975,642 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6d56b340e612db5dc64a343e67cb4dea67db8c01c80df847d237241f43176afb

Height

#2,861,277

Difficulty

11.674097

Transactions

3

Size

1.15 KB

Version

2

Bits

0bac919a

Nonce

1,983,497,866

Timestamp

9/30/2018, 1:48:34 PM

Confirmations

3,975,642

Merkle Root

8eee98a21af5cb101382042fe669a482f07557db7c60d9ed909b926ca9364e4c
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.

6.738 × 10⁹³(94-digit number)
67384378082129723305…23318873033630482561
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
6.738 × 10⁹³(94-digit number)
67384378082129723305…23318873033630482561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.347 × 10⁹⁴(95-digit number)
13476875616425944661…46637746067260965121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.695 × 10⁹⁴(95-digit number)
26953751232851889322…93275492134521930241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.390 × 10⁹⁴(95-digit number)
53907502465703778644…86550984269043860481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.078 × 10⁹⁵(96-digit number)
10781500493140755728…73101968538087720961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.156 × 10⁹⁵(96-digit number)
21563000986281511457…46203937076175441921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.312 × 10⁹⁵(96-digit number)
43126001972563022915…92407874152350883841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.625 × 10⁹⁵(96-digit number)
86252003945126045830…84815748304701767681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.725 × 10⁹⁶(97-digit number)
17250400789025209166…69631496609403535361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.450 × 10⁹⁶(97-digit number)
34500801578050418332…39262993218807070721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.900 × 10⁹⁶(97-digit number)
69001603156100836664…78525986437614141441
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,939,646 XPM·at block #6,836,918 · 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