Block #2,818,006

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/31/2018, 6:15:20 AM · Difficulty 11.6962 · 4,022,750 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ad53f907f118b48ebaa68d4d060b2ef051679f50295b6715a28906be790ae9a4

Height

#2,818,006

Difficulty

11.696190

Transactions

3

Size

914 B

Version

2

Bits

0bb23987

Nonce

1,053,167,165

Timestamp

8/31/2018, 6:15:20 AM

Confirmations

4,022,750

Merkle Root

2bcde5f0804732b0a6835e1740e6c111d077d57ccf393f2043a35dc935de2209
Transactions (3)
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.

3.171 × 10⁹⁶(97-digit number)
31712914761278281345…29435469534378383361
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
3.171 × 10⁹⁶(97-digit number)
31712914761278281345…29435469534378383361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.342 × 10⁹⁶(97-digit number)
63425829522556562691…58870939068756766721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.268 × 10⁹⁷(98-digit number)
12685165904511312538…17741878137513533441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.537 × 10⁹⁷(98-digit number)
25370331809022625076…35483756275027066881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.074 × 10⁹⁷(98-digit number)
50740663618045250153…70967512550054133761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.014 × 10⁹⁸(99-digit number)
10148132723609050030…41935025100108267521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.029 × 10⁹⁸(99-digit number)
20296265447218100061…83870050200216535041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.059 × 10⁹⁸(99-digit number)
40592530894436200122…67740100400433070081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.118 × 10⁹⁸(99-digit number)
81185061788872400245…35480200800866140161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.623 × 10⁹⁹(100-digit number)
16237012357774480049…70960401601732280321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.247 × 10⁹⁹(100-digit number)
32474024715548960098…41920803203464560641
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,970,389 XPM·at block #6,840,755 · 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