Block #2,787,271

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/10/2018, 3:36:26 AM · Difficulty 11.6742 · 4,056,449 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
43bffb1dbd96714cf459a5f6254cec43359ffb87fcb1285977cc5cc388dd52cd

Height

#2,787,271

Difficulty

11.674239

Transactions

38

Size

10.73 KB

Version

2

Bits

0bac9ae6

Nonce

421,076,141

Timestamp

8/10/2018, 3:36:26 AM

Confirmations

4,056,449

Merkle Root

6697e462b2749395a162d49bf69fe5ee7b64fcb97eb73c3417f95c410f0b12aa
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.

8.096 × 10⁹⁴(95-digit number)
80967251055618516030…57446878808862229759
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
8.096 × 10⁹⁴(95-digit number)
80967251055618516030…57446878808862229759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.619 × 10⁹⁵(96-digit number)
16193450211123703206…14893757617724459519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.238 × 10⁹⁵(96-digit number)
32386900422247406412…29787515235448919039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.477 × 10⁹⁵(96-digit number)
64773800844494812824…59575030470897838079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.295 × 10⁹⁶(97-digit number)
12954760168898962564…19150060941795676159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.590 × 10⁹⁶(97-digit number)
25909520337797925129…38300121883591352319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.181 × 10⁹⁶(97-digit number)
51819040675595850259…76600243767182704639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.036 × 10⁹⁷(98-digit number)
10363808135119170051…53200487534365409279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.072 × 10⁹⁷(98-digit number)
20727616270238340103…06400975068730818559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.145 × 10⁹⁷(98-digit number)
41455232540476680207…12801950137461637119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.291 × 10⁹⁷(98-digit number)
82910465080953360415…25603900274923274239
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,994,130 XPM·at block #6,843,719 · 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