Block #2,662,357

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/15/2018, 4:43:23 PM · Difficulty 11.6416 · 4,180,392 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c619d9d50e2c22555fb963a382d9c5a3ab4a22d7addf17ded1281184b91bb599

Height

#2,662,357

Difficulty

11.641558

Transactions

2

Size

726 B

Version

2

Bits

0ba43d21

Nonce

136,738,325

Timestamp

5/15/2018, 4:43:23 PM

Confirmations

4,180,392

Merkle Root

4228e97fae37f6d6266cfbacaf79d53331da14e4585ea06c959788a6c87010ab
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.

3.490 × 10⁹⁶(97-digit number)
34905004711916394345…29066698199505546241
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.490 × 10⁹⁶(97-digit number)
34905004711916394345…29066698199505546241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.981 × 10⁹⁶(97-digit number)
69810009423832788690…58133396399011092481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.396 × 10⁹⁷(98-digit number)
13962001884766557738…16266792798022184961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.792 × 10⁹⁷(98-digit number)
27924003769533115476…32533585596044369921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.584 × 10⁹⁷(98-digit number)
55848007539066230952…65067171192088739841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.116 × 10⁹⁸(99-digit number)
11169601507813246190…30134342384177479681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.233 × 10⁹⁸(99-digit number)
22339203015626492380…60268684768354959361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.467 × 10⁹⁸(99-digit number)
44678406031252984761…20537369536709918721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.935 × 10⁹⁸(99-digit number)
89356812062505969523…41074739073419837441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.787 × 10⁹⁹(100-digit number)
17871362412501193904…82149478146839674881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.574 × 10⁹⁹(100-digit number)
35742724825002387809…64298956293679349761
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,986,329 XPM·at block #6,842,748 · 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