Block #2,659,944

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/14/2018, 1:05:07 AM · Difficulty 11.6388 · 4,176,959 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5db8f20edad1683fad9e5d68a3d463d1a37c907080ae64d09d300a9ff6c197a7

Height

#2,659,944

Difficulty

11.638783

Transactions

14

Size

5.14 KB

Version

2

Bits

0ba3874d

Nonce

663,217,204

Timestamp

5/14/2018, 1:05:07 AM

Confirmations

4,176,959

Merkle Root

beb0dcb28ae392c58e5270d0a2f71414a21346447aecdeda4dc92463c7ac6c05
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.124 × 10⁹³(94-digit number)
51248668273940895255…69423707714831467521
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.124 × 10⁹³(94-digit number)
51248668273940895255…69423707714831467521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.024 × 10⁹⁴(95-digit number)
10249733654788179051…38847415429662935041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.049 × 10⁹⁴(95-digit number)
20499467309576358102…77694830859325870081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.099 × 10⁹⁴(95-digit number)
40998934619152716204…55389661718651740161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.199 × 10⁹⁴(95-digit number)
81997869238305432408…10779323437303480321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.639 × 10⁹⁵(96-digit number)
16399573847661086481…21558646874606960641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.279 × 10⁹⁵(96-digit number)
32799147695322172963…43117293749213921281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.559 × 10⁹⁵(96-digit number)
65598295390644345927…86234587498427842561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.311 × 10⁹⁶(97-digit number)
13119659078128869185…72469174996855685121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.623 × 10⁹⁶(97-digit number)
26239318156257738370…44938349993711370241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.247 × 10⁹⁶(97-digit number)
52478636312515476741…89876699987422740481
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,516 XPM·at block #6,836,902 · 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