Block #3,004,870

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/11/2019, 11:00:21 AM · Difficulty 11.2032 · 3,832,121 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
95e7ec74a1f9f66ec322692d8c00f983b3711a44971dc98a2be8a04f1da5840c

Height

#3,004,870

Difficulty

11.203226

Transactions

26

Size

8.42 KB

Version

2

Bits

0b34069e

Nonce

365,941,873

Timestamp

1/11/2019, 11:00:21 AM

Confirmations

3,832,121

Merkle Root

4c5b4a2497543e3242f7261f1ba5fcc822e4a7f2c4a2ec739d9ad5e234f3cfb6
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.291 × 10⁹⁷(98-digit number)
42914883549863383393…18257797679160176639
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.291 × 10⁹⁷(98-digit number)
42914883549863383393…18257797679160176639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.582 × 10⁹⁷(98-digit number)
85829767099726766786…36515595358320353279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.716 × 10⁹⁸(99-digit number)
17165953419945353357…73031190716640706559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.433 × 10⁹⁸(99-digit number)
34331906839890706714…46062381433281413119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.866 × 10⁹⁸(99-digit number)
68663813679781413428…92124762866562826239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.373 × 10⁹⁹(100-digit number)
13732762735956282685…84249525733125652479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.746 × 10⁹⁹(100-digit number)
27465525471912565371…68499051466251304959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.493 × 10⁹⁹(100-digit number)
54931050943825130743…36998102932502609919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.098 × 10¹⁰⁰(101-digit number)
10986210188765026148…73996205865005219839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.197 × 10¹⁰⁰(101-digit number)
21972420377530052297…47992411730010439679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.394 × 10¹⁰⁰(101-digit number)
43944840755060104594…95984823460020879359
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,940,229 XPM·at block #6,836,990 · 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