Block #2,618,138

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/17/2018, 2:51:45 PM · Difficulty 11.2367 · 4,223,806 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3d25b892fdaafe1e00c83e54237c4de146d9e66da1777a007e0849d1db285853

Height

#2,618,138

Difficulty

11.236700

Transactions

31

Size

7.25 KB

Version

2

Bits

0b3c9859

Nonce

600,072,772

Timestamp

4/17/2018, 2:51:45 PM

Confirmations

4,223,806

Merkle Root

7adc0160ca812b6882a32a8cb9755321585e97d8b8154e0860f23d74d6b9db34
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.

3.879 × 10⁹⁴(95-digit number)
38791623043474041034…06622224351007772839
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
3.879 × 10⁹⁴(95-digit number)
38791623043474041034…06622224351007772839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.758 × 10⁹⁴(95-digit number)
77583246086948082069…13244448702015545679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.551 × 10⁹⁵(96-digit number)
15516649217389616413…26488897404031091359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.103 × 10⁹⁵(96-digit number)
31033298434779232827…52977794808062182719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.206 × 10⁹⁵(96-digit number)
62066596869558465655…05955589616124365439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.241 × 10⁹⁶(97-digit number)
12413319373911693131…11911179232248730879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.482 × 10⁹⁶(97-digit number)
24826638747823386262…23822358464497461759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.965 × 10⁹⁶(97-digit number)
49653277495646772524…47644716928994923519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.930 × 10⁹⁶(97-digit number)
99306554991293545048…95289433857989847039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.986 × 10⁹⁷(98-digit number)
19861310998258709009…90578867715979694079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.972 × 10⁹⁷(98-digit number)
39722621996517418019…81157735431959388159
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,979,933 XPM·at block #6,841,943 · 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