Block #2,639,126

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2018, 1:12:35 PM · Difficulty 11.5234 · 4,203,418 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d6bc594af4e6dc7e95cf8554184300646e79d284f49830cb00aa1c97f2f009ea

Height

#2,639,126

Difficulty

11.523360

Transactions

3

Size

1.07 KB

Version

2

Bits

0b85fae7

Nonce

146,447,298

Timestamp

4/30/2018, 1:12:35 PM

Confirmations

4,203,418

Merkle Root

3d6db54d459771e4573cd11fe3b7ddd9526b17dbb85805b6e1e720e4ecd63b0e
Transactions (3)
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.

2.477 × 10⁹⁵(96-digit number)
24771784650889774040…67797154912346357359
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
2.477 × 10⁹⁵(96-digit number)
24771784650889774040…67797154912346357359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.954 × 10⁹⁵(96-digit number)
49543569301779548080…35594309824692714719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.908 × 10⁹⁵(96-digit number)
99087138603559096161…71188619649385429439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.981 × 10⁹⁶(97-digit number)
19817427720711819232…42377239298770858879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.963 × 10⁹⁶(97-digit number)
39634855441423638464…84754478597541717759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.926 × 10⁹⁶(97-digit number)
79269710882847276929…69508957195083435519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.585 × 10⁹⁷(98-digit number)
15853942176569455385…39017914390166871039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.170 × 10⁹⁷(98-digit number)
31707884353138910771…78035828780333742079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.341 × 10⁹⁷(98-digit number)
63415768706277821543…56071657560667484159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.268 × 10⁹⁸(99-digit number)
12683153741255564308…12143315121334968319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.536 × 10⁹⁸(99-digit number)
25366307482511128617…24286630242669936639
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,984,776 XPM·at block #6,842,543 · 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