Block #2,820,989

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/2/2018, 6:55:10 AM · Difficulty 11.7001 · 4,021,108 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ae4ed3959e709554ce04dc420f5447d62d08217c500fb77b5540145b8b7cf050

Height

#2,820,989

Difficulty

11.700078

Transactions

7

Size

4.10 KB

Version

2

Bits

0bb33848

Nonce

11,006,059

Timestamp

9/2/2018, 6:55:10 AM

Confirmations

4,021,108

Merkle Root

04ddf5ea1e86f08c3ce555acb448f5087dd98f2df7bab498468c5bb2ac89cbf3
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.027 × 10⁹⁵(96-digit number)
10270900966214446743…18736836856189098239
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.027 × 10⁹⁵(96-digit number)
10270900966214446743…18736836856189098239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.054 × 10⁹⁵(96-digit number)
20541801932428893486…37473673712378196479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.108 × 10⁹⁵(96-digit number)
41083603864857786972…74947347424756392959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.216 × 10⁹⁵(96-digit number)
82167207729715573944…49894694849512785919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.643 × 10⁹⁶(97-digit number)
16433441545943114788…99789389699025571839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.286 × 10⁹⁶(97-digit number)
32866883091886229577…99578779398051143679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.573 × 10⁹⁶(97-digit number)
65733766183772459155…99157558796102287359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.314 × 10⁹⁷(98-digit number)
13146753236754491831…98315117592204574719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.629 × 10⁹⁷(98-digit number)
26293506473508983662…96630235184409149439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.258 × 10⁹⁷(98-digit number)
52587012947017967324…93260470368818298879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.051 × 10⁹⁸(99-digit number)
10517402589403593464…86520940737636597759
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,981,162 XPM·at block #6,842,096 · 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