Block #2,786,786

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/9/2018, 7:51:30 PM · Difficulty 11.6730 · 4,049,980 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
da1fabadbf8dec0d1b1b8e75bc3758ec9fa74ba9bc1f5f20806a0884c383e3e9

Height

#2,786,786

Difficulty

11.672954

Transactions

5

Size

3.69 KB

Version

2

Bits

0bac46b5

Nonce

1,085,115,141

Timestamp

8/9/2018, 7:51:30 PM

Confirmations

4,049,980

Merkle Root

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

4.012 × 10⁹²(93-digit number)
40129294450811494725…37659321975471987281
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
4.012 × 10⁹²(93-digit number)
40129294450811494725…37659321975471987281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.025 × 10⁹²(93-digit number)
80258588901622989450…75318643950943974561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.605 × 10⁹³(94-digit number)
16051717780324597890…50637287901887949121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.210 × 10⁹³(94-digit number)
32103435560649195780…01274575803775898241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.420 × 10⁹³(94-digit number)
64206871121298391560…02549151607551796481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.284 × 10⁹⁴(95-digit number)
12841374224259678312…05098303215103592961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.568 × 10⁹⁴(95-digit number)
25682748448519356624…10196606430207185921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.136 × 10⁹⁴(95-digit number)
51365496897038713248…20393212860414371841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.027 × 10⁹⁵(96-digit number)
10273099379407742649…40786425720828743681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.054 × 10⁹⁵(96-digit number)
20546198758815485299…81572851441657487361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.109 × 10⁹⁵(96-digit number)
41092397517630970598…63145702883314974721
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,938,411 XPM·at block #6,836,765 · 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