Block #2,989,105

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/31/2018, 5:01:35 AM · Difficulty 11.2680 · 3,854,194 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1f859c176c2a37b1eaeaa6c701645ed9cb8ac1217a4e7e8dea309994a272078f

Height

#2,989,105

Difficulty

11.268039

Transactions

7

Size

1.69 KB

Version

2

Bits

0b449e31

Nonce

652,339,502

Timestamp

12/31/2018, 5:01:35 AM

Confirmations

3,854,194

Merkle Root

3607d4526b8f101a62533da4d3428e4e250c55c8e6dca8fa514a3ac5824bbb33
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.857 × 10⁹³(94-digit number)
58571783925739918692…86267271292358275039
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.857 × 10⁹³(94-digit number)
58571783925739918692…86267271292358275039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.171 × 10⁹⁴(95-digit number)
11714356785147983738…72534542584716550079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.342 × 10⁹⁴(95-digit number)
23428713570295967477…45069085169433100159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.685 × 10⁹⁴(95-digit number)
46857427140591934954…90138170338866200319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.371 × 10⁹⁴(95-digit number)
93714854281183869908…80276340677732400639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.874 × 10⁹⁵(96-digit number)
18742970856236773981…60552681355464801279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.748 × 10⁹⁵(96-digit number)
37485941712473547963…21105362710929602559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.497 × 10⁹⁵(96-digit number)
74971883424947095926…42210725421859205119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.499 × 10⁹⁶(97-digit number)
14994376684989419185…84421450843718410239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.998 × 10⁹⁶(97-digit number)
29988753369978838370…68842901687436820479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.997 × 10⁹⁶(97-digit number)
59977506739957676741…37685803374873640959
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,990,757 XPM·at block #6,843,298 · 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