Block #2,640,688

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2018, 2:15:34 AM · Difficulty 11.5916 · 4,204,336 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
647edade6bad4104633b74ddea692e47461a98588ccd92f9daa0e37e98edfb3c

Height

#2,640,688

Difficulty

11.591596

Transactions

14

Size

4.01 KB

Version

2

Bits

0b9772d1

Nonce

12,524,088

Timestamp

5/1/2018, 2:15:34 AM

Confirmations

4,204,336

Merkle Root

f0969106099cac2affdbb34b080e09c1d2039d8fd3695fd35aa42f3ec3c68670
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.484 × 10⁹⁴(95-digit number)
34849839137155834640…17165132123808103799
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.484 × 10⁹⁴(95-digit number)
34849839137155834640…17165132123808103799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.969 × 10⁹⁴(95-digit number)
69699678274311669281…34330264247616207599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.393 × 10⁹⁵(96-digit number)
13939935654862333856…68660528495232415199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.787 × 10⁹⁵(96-digit number)
27879871309724667712…37321056990464830399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.575 × 10⁹⁵(96-digit number)
55759742619449335425…74642113980929660799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.115 × 10⁹⁶(97-digit number)
11151948523889867085…49284227961859321599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.230 × 10⁹⁶(97-digit number)
22303897047779734170…98568455923718643199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.460 × 10⁹⁶(97-digit number)
44607794095559468340…97136911847437286399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.921 × 10⁹⁶(97-digit number)
89215588191118936680…94273823694874572799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.784 × 10⁹⁷(98-digit number)
17843117638223787336…88547647389749145599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.568 × 10⁹⁷(98-digit number)
35686235276447574672…77095294779498291199
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:58,004,617 XPM·at block #6,845,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