Block #2,828,154

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/7/2018, 2:56:11 AM · Difficulty 11.7123 · 4,016,332 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8678e845c25023fa3d38793bb6b0f0a8f5f08211c25dab7b0521f6640be8bfc1

Height

#2,828,154

Difficulty

11.712292

Transactions

9

Size

3.21 KB

Version

2

Bits

0bb658c4

Nonce

1,510,534,028

Timestamp

9/7/2018, 2:56:11 AM

Confirmations

4,016,332

Merkle Root

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

6.507 × 10⁹⁵(96-digit number)
65076039746709158698…76329921835637555199
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
6.507 × 10⁹⁵(96-digit number)
65076039746709158698…76329921835637555199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.301 × 10⁹⁶(97-digit number)
13015207949341831739…52659843671275110399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.603 × 10⁹⁶(97-digit number)
26030415898683663479…05319687342550220799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.206 × 10⁹⁶(97-digit number)
52060831797367326958…10639374685100441599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.041 × 10⁹⁷(98-digit number)
10412166359473465391…21278749370200883199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.082 × 10⁹⁷(98-digit number)
20824332718946930783…42557498740401766399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.164 × 10⁹⁷(98-digit number)
41648665437893861566…85114997480803532799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.329 × 10⁹⁷(98-digit number)
83297330875787723133…70229994961607065599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.665 × 10⁹⁸(99-digit number)
16659466175157544626…40459989923214131199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.331 × 10⁹⁸(99-digit number)
33318932350315089253…80919979846428262399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.663 × 10⁹⁸(99-digit number)
66637864700630178507…61839959692856524799
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:58,000,284 XPM·at block #6,844,485 · 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