Block #2,645,378

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2018, 9:18:11 PM · Difficulty 11.7313 · 4,188,356 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cfd3f6b11bf209403e3906dfb0b25efca8a47ee3143c8913a9814e814edbec65

Height

#2,645,378

Difficulty

11.731272

Transactions

5

Size

1.70 KB

Version

2

Bits

0bbb349f

Nonce

305,751,449

Timestamp

5/2/2018, 9:18:11 PM

Confirmations

4,188,356

Merkle Root

3850ae75c2455d4b4bac62c709687da1010a3f6e0456ea0d165950cc9606839b
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.

4.288 × 10⁹⁵(96-digit number)
42880914042826264576…68280081893133987279
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
4.288 × 10⁹⁵(96-digit number)
42880914042826264576…68280081893133987279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.576 × 10⁹⁵(96-digit number)
85761828085652529152…36560163786267974559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.715 × 10⁹⁶(97-digit number)
17152365617130505830…73120327572535949119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.430 × 10⁹⁶(97-digit number)
34304731234261011660…46240655145071898239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.860 × 10⁹⁶(97-digit number)
68609462468522023321…92481310290143796479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.372 × 10⁹⁷(98-digit number)
13721892493704404664…84962620580287592959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.744 × 10⁹⁷(98-digit number)
27443784987408809328…69925241160575185919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.488 × 10⁹⁷(98-digit number)
54887569974817618657…39850482321150371839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.097 × 10⁹⁸(99-digit number)
10977513994963523731…79700964642300743679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.195 × 10⁹⁸(99-digit number)
21955027989927047462…59401929284601487359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.391 × 10⁹⁸(99-digit number)
43910055979854094925…18803858569202974719
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,914,096 XPM·at block #6,833,733 · 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