Block #2,850,574

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/22/2018, 11:41:01 AM · Difficulty 11.7293 · 3,991,952 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5ef2a9b71a98100bea4bff0d0322d60bc151b30e87de18cc6161527c70ae2a2a

Height

#2,850,574

Difficulty

11.729330

Transactions

2

Size

8.41 KB

Version

2

Bits

0bbab55a

Nonce

215,842,973

Timestamp

9/22/2018, 11:41:01 AM

Confirmations

3,991,952

Merkle Root

273cdf0b8f6cd2a6ef84fcd030cfccf9d39db8b583a3c1c5b56a99fe6955e2b5
Transactions (2)
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.464 × 10⁹⁵(96-digit number)
44645279247425815533…61837344643329457921
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.464 × 10⁹⁵(96-digit number)
44645279247425815533…61837344643329457921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.929 × 10⁹⁵(96-digit number)
89290558494851631066…23674689286658915841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.785 × 10⁹⁶(97-digit number)
17858111698970326213…47349378573317831681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.571 × 10⁹⁶(97-digit number)
35716223397940652426…94698757146635663361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.143 × 10⁹⁶(97-digit number)
71432446795881304852…89397514293271326721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.428 × 10⁹⁷(98-digit number)
14286489359176260970…78795028586542653441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.857 × 10⁹⁷(98-digit number)
28572978718352521941…57590057173085306881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.714 × 10⁹⁷(98-digit number)
57145957436705043882…15180114346170613761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.142 × 10⁹⁸(99-digit number)
11429191487341008776…30360228692341227521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.285 × 10⁹⁸(99-digit number)
22858382974682017552…60720457384682455041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.571 × 10⁹⁸(99-digit number)
45716765949364035105…21440914769364910081
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,984,629 XPM·at block #6,842,525 · 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