Block #2,640,710

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2018, 2:26:42 AM · Difficulty 11.5925 · 4,191,874 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
695f5fb8998fc02e1090a1efcd506654cf3f5f5153a2bcee07c9047578d72907

Height

#2,640,710

Difficulty

11.592495

Transactions

49

Size

13.40 KB

Version

2

Bits

0b97adbd

Nonce

92,234,450

Timestamp

5/1/2018, 2:26:42 AM

Confirmations

4,191,874

Merkle Root

c131072450a86417d267d595056249c9b2212ba35ce363f6cb48097c2f33ced9
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.011 × 10⁹⁷(98-digit number)
20112093272298239620…33919157787034173439
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.011 × 10⁹⁷(98-digit number)
20112093272298239620…33919157787034173439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.022 × 10⁹⁷(98-digit number)
40224186544596479240…67838315574068346879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.044 × 10⁹⁷(98-digit number)
80448373089192958480…35676631148136693759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.608 × 10⁹⁸(99-digit number)
16089674617838591696…71353262296273387519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.217 × 10⁹⁸(99-digit number)
32179349235677183392…42706524592546775039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.435 × 10⁹⁸(99-digit number)
64358698471354366784…85413049185093550079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.287 × 10⁹⁹(100-digit number)
12871739694270873356…70826098370187100159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.574 × 10⁹⁹(100-digit number)
25743479388541746713…41652196740374200319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.148 × 10⁹⁹(100-digit number)
51486958777083493427…83304393480748400639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.029 × 10¹⁰⁰(101-digit number)
10297391755416698685…66608786961496801279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.059 × 10¹⁰⁰(101-digit number)
20594783510833397370…33217573922993602559
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,904,820 XPM·at block #6,832,583 · 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