Block #2,635,325

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2018, 5:17:00 AM · Difficulty 11.3069 · 4,195,354 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6692123e00044118c6ec16c8311f7017662bc2d6eee6052d084ddca5b7582ca9

Height

#2,635,325

Difficulty

11.306906

Transactions

5

Size

1.85 KB

Version

2

Bits

0b4e915f

Nonce

125,554,861

Timestamp

4/29/2018, 5:17:00 AM

Confirmations

4,195,354

Merkle Root

359bf00ddd8dfb2fd8d838d99855502ba68ab0ef840e40538a38270ab7a86f1b
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.

5.982 × 10⁹⁴(95-digit number)
59822652802271438933…90340388123260377601
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
5.982 × 10⁹⁴(95-digit number)
59822652802271438933…90340388123260377601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.196 × 10⁹⁵(96-digit number)
11964530560454287786…80680776246520755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.392 × 10⁹⁵(96-digit number)
23929061120908575573…61361552493041510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.785 × 10⁹⁵(96-digit number)
47858122241817151146…22723104986083020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.571 × 10⁹⁵(96-digit number)
95716244483634302293…45446209972166041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.914 × 10⁹⁶(97-digit number)
19143248896726860458…90892419944332083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.828 × 10⁹⁶(97-digit number)
38286497793453720917…81784839888664166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.657 × 10⁹⁶(97-digit number)
76572995586907441834…63569679777328332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.531 × 10⁹⁷(98-digit number)
15314599117381488366…27139359554656665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.062 × 10⁹⁷(98-digit number)
30629198234762976733…54278719109313331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.125 × 10⁹⁷(98-digit number)
61258396469525953467…08557438218626662401
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,889,562 XPM·at block #6,830,678 · 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