Block #2,638,359

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2018, 6:17:18 AM · Difficulty 11.4888 · 4,203,719 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
775a6b9a4aefb3ebff8d2fe1ba25a07761c9a36b0951e711a8bb0f40abbc4e8a

Height

#2,638,359

Difficulty

11.488795

Transactions

26

Size

9.11 KB

Version

2

Bits

0b7d21ab

Nonce

420,942,029

Timestamp

4/30/2018, 6:17:18 AM

Confirmations

4,203,719

Merkle Root

2f101c537f5b46ba9486e48104bfb79c4de9156ffcf6d0bb347b4caf8c302081
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.620 × 10⁹⁷(98-digit number)
56201991311999091706…38642070319132241919
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.620 × 10⁹⁷(98-digit number)
56201991311999091706…38642070319132241919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.124 × 10⁹⁸(99-digit number)
11240398262399818341…77284140638264483839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.248 × 10⁹⁸(99-digit number)
22480796524799636682…54568281276528967679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.496 × 10⁹⁸(99-digit number)
44961593049599273365…09136562553057935359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.992 × 10⁹⁸(99-digit number)
89923186099198546730…18273125106115870719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.798 × 10⁹⁹(100-digit number)
17984637219839709346…36546250212231741439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.596 × 10⁹⁹(100-digit number)
35969274439679418692…73092500424463482879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.193 × 10⁹⁹(100-digit number)
71938548879358837384…46185000848926965759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.438 × 10¹⁰⁰(101-digit number)
14387709775871767476…92370001697853931519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.877 × 10¹⁰⁰(101-digit number)
28775419551743534953…84740003395707863039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.755 × 10¹⁰⁰(101-digit number)
57550839103487069907…69480006791415726079
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,981,008 XPM·at block #6,842,077 · 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