Block #2,634,821

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2018, 1:03:16 AM · Difficulty 11.2716 · 4,199,202 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
77475c08280a03f3993d7067104882c3a6c460d554d68c519f37f25f09ecb629

Height

#2,634,821

Difficulty

11.271611

Transactions

2

Size

425 B

Version

2

Bits

0b458848

Nonce

695,856,575

Timestamp

4/29/2018, 1:03:16 AM

Confirmations

4,199,202

Merkle Root

c7ada8f8aa3ec02309ec7ed34a1f1b67eb62171932fe920081a0f1bc9638add3
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.

1.280 × 10⁹⁵(96-digit number)
12808924766579332917…96882387886878958721
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
1.280 × 10⁹⁵(96-digit number)
12808924766579332917…96882387886878958721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.561 × 10⁹⁵(96-digit number)
25617849533158665835…93764775773757917441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.123 × 10⁹⁵(96-digit number)
51235699066317331671…87529551547515834881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.024 × 10⁹⁶(97-digit number)
10247139813263466334…75059103095031669761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.049 × 10⁹⁶(97-digit number)
20494279626526932668…50118206190063339521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.098 × 10⁹⁶(97-digit number)
40988559253053865337…00236412380126679041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.197 × 10⁹⁶(97-digit number)
81977118506107730674…00472824760253358081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.639 × 10⁹⁷(98-digit number)
16395423701221546134…00945649520506716161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.279 × 10⁹⁷(98-digit number)
32790847402443092269…01891299041013432321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.558 × 10⁹⁷(98-digit number)
65581694804886184539…03782598082026864641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.311 × 10⁹⁸(99-digit number)
13116338960977236907…07565196164053729281
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,916,410 XPM·at block #6,834,022 · 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