Block #2,871,351

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/7/2018, 3:44:40 PM · Difficulty 11.6664 · 3,973,255 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f2e52d849a7cd33bceb383306d971d9bfafbcbe6ba87c46e0f432184591049de

Height

#2,871,351

Difficulty

11.666439

Transactions

5

Size

2.23 KB

Version

2

Bits

0baa9bc1

Nonce

960,968,727

Timestamp

10/7/2018, 3:44:40 PM

Confirmations

3,973,255

Merkle Root

0a6fe0b1d6319fb954d1da2ffbeb0125d2c9740ebfd4e364955db2e35a9893fd
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.650 × 10⁹⁴(95-digit number)
56504311707289155536…19476904530709562799
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.650 × 10⁹⁴(95-digit number)
56504311707289155536…19476904530709562799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.130 × 10⁹⁵(96-digit number)
11300862341457831107…38953809061419125599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.260 × 10⁹⁵(96-digit number)
22601724682915662214…77907618122838251199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.520 × 10⁹⁵(96-digit number)
45203449365831324429…55815236245676502399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.040 × 10⁹⁵(96-digit number)
90406898731662648858…11630472491353004799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.808 × 10⁹⁶(97-digit number)
18081379746332529771…23260944982706009599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.616 × 10⁹⁶(97-digit number)
36162759492665059543…46521889965412019199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.232 × 10⁹⁶(97-digit number)
72325518985330119087…93043779930824038399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.446 × 10⁹⁷(98-digit number)
14465103797066023817…86087559861648076799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.893 × 10⁹⁷(98-digit number)
28930207594132047634…72175119723296153599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.786 × 10⁹⁷(98-digit number)
57860415188264095269…44350239446592307199
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:58,001,250 XPM·at block #6,844,605 · 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