Block #2,792,344

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/13/2018, 3:55:25 PM · Difficulty 11.6753 · 4,044,171 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b8151721ef06c0fb104dd10c914e8f667a67e1e97e801aa99bbfffa751e4aaad

Height

#2,792,344

Difficulty

11.675252

Transactions

6

Size

2.11 KB

Version

2

Bits

0bacdd4e

Nonce

1,454,922,888

Timestamp

8/13/2018, 3:55:25 PM

Confirmations

4,044,171

Merkle Root

c303067a71b99ec602c42bdb7b87f814cc126ad7d94179b84677d46d433a7409
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.389 × 10⁹⁴(95-digit number)
23895748767337949767…35128435279911337519
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.389 × 10⁹⁴(95-digit number)
23895748767337949767…35128435279911337519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.779 × 10⁹⁴(95-digit number)
47791497534675899534…70256870559822675039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.558 × 10⁹⁴(95-digit number)
95582995069351799068…40513741119645350079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.911 × 10⁹⁵(96-digit number)
19116599013870359813…81027482239290700159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.823 × 10⁹⁵(96-digit number)
38233198027740719627…62054964478581400319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.646 × 10⁹⁵(96-digit number)
76466396055481439255…24109928957162800639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.529 × 10⁹⁶(97-digit number)
15293279211096287851…48219857914325601279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.058 × 10⁹⁶(97-digit number)
30586558422192575702…96439715828651202559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.117 × 10⁹⁶(97-digit number)
61173116844385151404…92879431657302405119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.223 × 10⁹⁷(98-digit number)
12234623368877030280…85758863314604810239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.446 × 10⁹⁷(98-digit number)
24469246737754060561…71517726629209620479
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,936,396 XPM·at block #6,836,514 · 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