Block #2,644,319

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2018, 10:51:04 AM · Difficulty 11.7073 · 4,186,675 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b88aae8a9a21b04bb184fb25ff4c7ba515bea601b6fff4a72f54aea216ae193c

Height

#2,644,319

Difficulty

11.707256

Transactions

38

Size

9.39 KB

Version

2

Bits

0bb50ec0

Nonce

138,529,116

Timestamp

5/2/2018, 10:51:04 AM

Confirmations

4,186,675

Merkle Root

1813397bc1f8dd5908355e7394784831be28ccf87ca62f5dc6dd466d39d41173
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.

4.845 × 10⁹⁴(95-digit number)
48452248394190446025…36799687978574407999
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
4.845 × 10⁹⁴(95-digit number)
48452248394190446025…36799687978574407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.690 × 10⁹⁴(95-digit number)
96904496788380892050…73599375957148815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.938 × 10⁹⁵(96-digit number)
19380899357676178410…47198751914297631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.876 × 10⁹⁵(96-digit number)
38761798715352356820…94397503828595263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.752 × 10⁹⁵(96-digit number)
77523597430704713640…88795007657190527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.550 × 10⁹⁶(97-digit number)
15504719486140942728…77590015314381055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.100 × 10⁹⁶(97-digit number)
31009438972281885456…55180030628762111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.201 × 10⁹⁶(97-digit number)
62018877944563770912…10360061257524223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.240 × 10⁹⁷(98-digit number)
12403775588912754182…20720122515048447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.480 × 10⁹⁷(98-digit number)
24807551177825508365…41440245030096895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.961 × 10⁹⁷(98-digit number)
49615102355651016730…82880490060193791999
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,892,093 XPM·at block #6,830,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