Block #2,978,749

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/23/2018, 9:53:51 PM · Difficulty 11.2896 · 3,855,250 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fd805741bc30dec879c0948443baea145d8e457b518ddae46f35266c8117e680

Height

#2,978,749

Difficulty

11.289557

Transactions

11

Size

5.12 KB

Version

2

Bits

0b4a2070

Nonce

28,413,152

Timestamp

12/23/2018, 9:53:51 PM

Confirmations

3,855,250

Merkle Root

902b7be47ed73b147b6fc4decd05d120e4da007de5b6ac0bcd3ed83e86cc699b
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.741 × 10⁹³(94-digit number)
27416211729796390417…48205753398967524319
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.741 × 10⁹³(94-digit number)
27416211729796390417…48205753398967524319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.483 × 10⁹³(94-digit number)
54832423459592780835…96411506797935048639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.096 × 10⁹⁴(95-digit number)
10966484691918556167…92823013595870097279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.193 × 10⁹⁴(95-digit number)
21932969383837112334…85646027191740194559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.386 × 10⁹⁴(95-digit number)
43865938767674224668…71292054383480389119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.773 × 10⁹⁴(95-digit number)
87731877535348449336…42584108766960778239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.754 × 10⁹⁵(96-digit number)
17546375507069689867…85168217533921556479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.509 × 10⁹⁵(96-digit number)
35092751014139379734…70336435067843112959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.018 × 10⁹⁵(96-digit number)
70185502028278759468…40672870135686225919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.403 × 10⁹⁶(97-digit number)
14037100405655751893…81345740271372451839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.807 × 10⁹⁶(97-digit number)
28074200811311503787…62691480542744903679
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,916,219 XPM·at block #6,833,998 · 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