Block #2,700,531

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/11/2018, 6:17:51 AM · Difficulty 11.6371 · 4,141,495 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d1d1b6022d3b3ad28808338a1d4817598d1bd339c19e0158b13d3fe5b149597d

Height

#2,700,531

Difficulty

11.637117

Transactions

7

Size

1.97 KB

Version

2

Bits

0ba31a18

Nonce

411,291,300

Timestamp

6/11/2018, 6:17:51 AM

Confirmations

4,141,495

Merkle Root

8fa469ced5e2589ff05a1b9b859f4b3865d105836cb26fcf22253ac3d0bac4bd
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.356 × 10⁹⁶(97-digit number)
53568194881601547637…65034403235955609599
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.356 × 10⁹⁶(97-digit number)
53568194881601547637…65034403235955609599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.071 × 10⁹⁷(98-digit number)
10713638976320309527…30068806471911219199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.142 × 10⁹⁷(98-digit number)
21427277952640619054…60137612943822438399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.285 × 10⁹⁷(98-digit number)
42854555905281238109…20275225887644876799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.570 × 10⁹⁷(98-digit number)
85709111810562476219…40550451775289753599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.714 × 10⁹⁸(99-digit number)
17141822362112495243…81100903550579507199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.428 × 10⁹⁸(99-digit number)
34283644724224990487…62201807101159014399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.856 × 10⁹⁸(99-digit number)
68567289448449980975…24403614202318028799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.371 × 10⁹⁹(100-digit number)
13713457889689996195…48807228404636057599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.742 × 10⁹⁹(100-digit number)
27426915779379992390…97614456809272115199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.485 × 10⁹⁹(100-digit number)
54853831558759984780…95228913618544230399
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,980,594 XPM·at block #6,842,025 · 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