Block #2,635,344

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2018, 5:27:48 AM · Difficulty 11.3080 · 4,201,680 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8140fa6f92f3e767fff45083d104a9096869bc7eb8f6f91d4d61a382e114a366

Height

#2,635,344

Difficulty

11.308026

Transactions

7

Size

2.12 KB

Version

2

Bits

0b4edace

Nonce

214,591,654

Timestamp

4/29/2018, 5:27:48 AM

Confirmations

4,201,680

Merkle Root

a99898f4be0756d4e386a1b5b3bc2d938580be9684a0733a3f7b1db20ce1f401
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.903 × 10⁹⁶(97-digit number)
19033676662432133300…33227204115187394561
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.903 × 10⁹⁶(97-digit number)
19033676662432133300…33227204115187394561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.806 × 10⁹⁶(97-digit number)
38067353324864266601…66454408230374789121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.613 × 10⁹⁶(97-digit number)
76134706649728533202…32908816460749578241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.522 × 10⁹⁷(98-digit number)
15226941329945706640…65817632921499156481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.045 × 10⁹⁷(98-digit number)
30453882659891413280…31635265842998312961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.090 × 10⁹⁷(98-digit number)
60907765319782826561…63270531685996625921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.218 × 10⁹⁸(99-digit number)
12181553063956565312…26541063371993251841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.436 × 10⁹⁸(99-digit number)
24363106127913130624…53082126743986503681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.872 × 10⁹⁸(99-digit number)
48726212255826261249…06164253487973007361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.745 × 10⁹⁸(99-digit number)
97452424511652522498…12328506975946014721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.949 × 10⁹⁹(100-digit number)
19490484902330504499…24657013951892029441
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,940,491 XPM·at block #6,837,023 · 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