Block #2,656,883

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/11/2018, 11:40:27 AM · Difficulty 11.6807 · 4,185,392 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
47cdedee984bd4243bf752aab521f51dc8994553f0f220a7d07c2b7fabb4f9c8

Height

#2,656,883

Difficulty

11.680745

Transactions

2

Size

722 B

Version

2

Bits

0bae454d

Nonce

82,042,521

Timestamp

5/11/2018, 11:40:27 AM

Confirmations

4,185,392

Merkle Root

436ff5b323a6fe50ac50ad0a23e67bb75c768d6001d68007248004fd94a7b5d5
Transactions (2)
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.

1.061 × 10⁹⁶(97-digit number)
10613029603432138120…24743428115426544639
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
1.061 × 10⁹⁶(97-digit number)
10613029603432138120…24743428115426544639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.122 × 10⁹⁶(97-digit number)
21226059206864276241…49486856230853089279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.245 × 10⁹⁶(97-digit number)
42452118413728552482…98973712461706178559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.490 × 10⁹⁶(97-digit number)
84904236827457104965…97947424923412357119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.698 × 10⁹⁷(98-digit number)
16980847365491420993…95894849846824714239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.396 × 10⁹⁷(98-digit number)
33961694730982841986…91789699693649428479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.792 × 10⁹⁷(98-digit number)
67923389461965683972…83579399387298856959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.358 × 10⁹⁸(99-digit number)
13584677892393136794…67158798774597713919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.716 × 10⁹⁸(99-digit number)
27169355784786273589…34317597549195427839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.433 × 10⁹⁸(99-digit number)
54338711569572547178…68635195098390855679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.086 × 10⁹⁹(100-digit number)
10867742313914509435…37270390196781711359
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,982,601 XPM·at block #6,842,274 · 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