Block #2,636,864

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2018, 5:57:36 PM · Difficulty 11.4061 · 4,194,636 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bb7aa63610d1a03b3919a1b8139be0c3cb763fd3088a69b0e748ed8aee375b27

Height

#2,636,864

Difficulty

11.406104

Transactions

2

Size

576 B

Version

2

Bits

0b67f66a

Nonce

29,787,917

Timestamp

4/29/2018, 5:57:36 PM

Confirmations

4,194,636

Merkle Root

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

2.125 × 10⁹⁶(97-digit number)
21257315942077923234…89147731357384951041
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
2.125 × 10⁹⁶(97-digit number)
21257315942077923234…89147731357384951041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.251 × 10⁹⁶(97-digit number)
42514631884155846469…78295462714769902081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.502 × 10⁹⁶(97-digit number)
85029263768311692939…56590925429539804161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.700 × 10⁹⁷(98-digit number)
17005852753662338587…13181850859079608321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.401 × 10⁹⁷(98-digit number)
34011705507324677175…26363701718159216641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.802 × 10⁹⁷(98-digit number)
68023411014649354351…52727403436318433281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.360 × 10⁹⁸(99-digit number)
13604682202929870870…05454806872636866561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.720 × 10⁹⁸(99-digit number)
27209364405859741740…10909613745273733121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.441 × 10⁹⁸(99-digit number)
54418728811719483481…21819227490547466241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.088 × 10⁹⁹(100-digit number)
10883745762343896696…43638454981094932481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.176 × 10⁹⁹(100-digit number)
21767491524687793392…87276909962189864961
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,896,087 XPM·at block #6,831,499 · 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