Block #2,776,868

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/3/2018, 2:14:39 AM · Difficulty 11.6579 · 4,060,913 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8dac954f50fe683f3a540abb8c0f68585b345524654a5a179173bb187022ebb9

Height

#2,776,868

Difficulty

11.657901

Transactions

6

Size

1.72 KB

Version

2

Bits

0ba86c2e

Nonce

294,136,274

Timestamp

8/3/2018, 2:14:39 AM

Confirmations

4,060,913

Merkle Root

dc7bad07b1c9dafd8a49fcaa2880348c9d87fa19a6e5adf4ca08c336f6731894
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.944 × 10⁹³(94-digit number)
59444570664390677142…20920354379639408359
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.944 × 10⁹³(94-digit number)
59444570664390677142…20920354379639408359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.188 × 10⁹⁴(95-digit number)
11888914132878135428…41840708759278816719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.377 × 10⁹⁴(95-digit number)
23777828265756270856…83681417518557633439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.755 × 10⁹⁴(95-digit number)
47555656531512541713…67362835037115266879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.511 × 10⁹⁴(95-digit number)
95111313063025083427…34725670074230533759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.902 × 10⁹⁵(96-digit number)
19022262612605016685…69451340148461067519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.804 × 10⁹⁵(96-digit number)
38044525225210033370…38902680296922135039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.608 × 10⁹⁵(96-digit number)
76089050450420066741…77805360593844270079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.521 × 10⁹⁶(97-digit number)
15217810090084013348…55610721187688540159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.043 × 10⁹⁶(97-digit number)
30435620180168026696…11221442375377080319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.087 × 10⁹⁶(97-digit number)
60871240360336053393…22442884750754160639
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,946,585 XPM·at block #6,837,780 · 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