Block #2,865,446

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/3/2018, 12:18:33 PM · Difficulty 11.6701 · 3,968,286 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d81f692b9269d8359219845b6b61c1be71ca566b4e6e90e3171b524ea549b92a

Height

#2,865,446

Difficulty

11.670139

Transactions

3

Size

619 B

Version

2

Bits

0bab8e3d

Nonce

131,423,346

Timestamp

10/3/2018, 12:18:33 PM

Confirmations

3,968,286

Merkle Root

f0d9c4126d116d5efadc4b32765a1537e470e44f50dafcfce1ef1c870d6e24f2
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.298 × 10⁹⁵(96-digit number)
42984451009604685600…33061601890959702399
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.298 × 10⁹⁵(96-digit number)
42984451009604685600…33061601890959702399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.596 × 10⁹⁵(96-digit number)
85968902019209371200…66123203781919404799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.719 × 10⁹⁶(97-digit number)
17193780403841874240…32246407563838809599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.438 × 10⁹⁶(97-digit number)
34387560807683748480…64492815127677619199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.877 × 10⁹⁶(97-digit number)
68775121615367496960…28985630255355238399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.375 × 10⁹⁷(98-digit number)
13755024323073499392…57971260510710476799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.751 × 10⁹⁷(98-digit number)
27510048646146998784…15942521021420953599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.502 × 10⁹⁷(98-digit number)
55020097292293997568…31885042042841907199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.100 × 10⁹⁸(99-digit number)
11004019458458799513…63770084085683814399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.200 × 10⁹⁸(99-digit number)
22008038916917599027…27540168171367628799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.401 × 10⁹⁸(99-digit number)
44016077833835198054…55080336342735257599
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,079 XPM·at block #6,833,731 · 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