Block #2,649,305

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/5/2018, 3:39:46 AM · Difficulty 11.7647 · 4,183,649 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
432b27bf64073fc244bdf47ef180bf0d4264ce34378279c4ec092bbb16156986

Height

#2,649,305

Difficulty

11.764706

Transactions

5

Size

2.09 KB

Version

2

Bits

0bc3c3c8

Nonce

222,522,632

Timestamp

5/5/2018, 3:39:46 AM

Confirmations

4,183,649

Merkle Root

d4514f355deb960738fc86277bb2089113d8793df1521e12ec44e0f5632bee34
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.265 × 10⁹⁷(98-digit number)
32650188840432467308…91426139520801546239
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.265 × 10⁹⁷(98-digit number)
32650188840432467308…91426139520801546239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.530 × 10⁹⁷(98-digit number)
65300377680864934616…82852279041603092479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.306 × 10⁹⁸(99-digit number)
13060075536172986923…65704558083206184959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.612 × 10⁹⁸(99-digit number)
26120151072345973846…31409116166412369919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.224 × 10⁹⁸(99-digit number)
52240302144691947693…62818232332824739839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.044 × 10⁹⁹(100-digit number)
10448060428938389538…25636464665649479679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.089 × 10⁹⁹(100-digit number)
20896120857876779077…51272929331298959359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.179 × 10⁹⁹(100-digit number)
41792241715753558154…02545858662597918719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.358 × 10⁹⁹(100-digit number)
83584483431507116309…05091717325195837439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.671 × 10¹⁰⁰(101-digit number)
16716896686301423261…10183434650391674879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.343 × 10¹⁰⁰(101-digit number)
33433793372602846523…20366869300783349759
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,907,811 XPM·at block #6,832,953 · 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