Block #3,008,191

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2019, 6:09:59 PM · Difficulty 11.2054 · 3,829,991 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ec65cbd52be4f7e9d3ad30cbae21095deb4a7573021f78a77dd45916b86cefd9

Height

#3,008,191

Difficulty

11.205428

Transactions

29

Size

6.67 KB

Version

2

Bits

0b3496ec

Nonce

1,573,751,317

Timestamp

1/13/2019, 6:09:59 PM

Confirmations

3,829,991

Merkle Root

c8df305b3055b4a806422bc1defc29af52a558b36103a9a66c08fcd0883eb747
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.218 × 10⁹⁸(99-digit number)
12185834880004678292…37402064153303900159
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.218 × 10⁹⁸(99-digit number)
12185834880004678292…37402064153303900159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.437 × 10⁹⁸(99-digit number)
24371669760009356584…74804128306607800319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.874 × 10⁹⁸(99-digit number)
48743339520018713168…49608256613215600639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.748 × 10⁹⁸(99-digit number)
97486679040037426336…99216513226431201279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.949 × 10⁹⁹(100-digit number)
19497335808007485267…98433026452862402559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.899 × 10⁹⁹(100-digit number)
38994671616014970534…96866052905724805119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.798 × 10⁹⁹(100-digit number)
77989343232029941068…93732105811449610239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.559 × 10¹⁰⁰(101-digit number)
15597868646405988213…87464211622899220479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.119 × 10¹⁰⁰(101-digit number)
31195737292811976427…74928423245798440959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.239 × 10¹⁰⁰(101-digit number)
62391474585623952855…49856846491596881919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.247 × 10¹⁰¹(102-digit number)
12478294917124790571…99713692983193763839
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,949,729 XPM·at block #6,838,181 · 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