Block #2,650,095

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/5/2018, 6:44:18 PM · Difficulty 11.7594 · 4,191,899 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3e9f28f9e59c56c1fe9f6947cf76cbd992d3058c4103d71d63f5a81b7626ca7d

Height

#2,650,095

Difficulty

11.759432

Transactions

2

Size

723 B

Version

2

Bits

0bc26a27

Nonce

1,137,416,857

Timestamp

5/5/2018, 6:44:18 PM

Confirmations

4,191,899

Merkle Root

a90806e5263b4f7950c1ff2073ca91603bc500d385690ca838059cadfaa6825d
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.587 × 10⁹⁷(98-digit number)
15875993147453969259…28486216526631782399
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.587 × 10⁹⁷(98-digit number)
15875993147453969259…28486216526631782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.175 × 10⁹⁷(98-digit number)
31751986294907938518…56972433053263564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.350 × 10⁹⁷(98-digit number)
63503972589815877037…13944866106527129599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.270 × 10⁹⁸(99-digit number)
12700794517963175407…27889732213054259199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.540 × 10⁹⁸(99-digit number)
25401589035926350815…55779464426108518399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.080 × 10⁹⁸(99-digit number)
50803178071852701630…11558928852217036799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.016 × 10⁹⁹(100-digit number)
10160635614370540326…23117857704434073599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.032 × 10⁹⁹(100-digit number)
20321271228741080652…46235715408868147199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.064 × 10⁹⁹(100-digit number)
40642542457482161304…92471430817736294399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.128 × 10⁹⁹(100-digit number)
81285084914964322608…84942861635472588799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.625 × 10¹⁰⁰(101-digit number)
16257016982992864521…69885723270945177599
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,980,340 XPM·at block #6,841,993 · 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