Block #2,991,775

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/2/2019, 2:23:58 AM · Difficulty 11.2607 · 3,850,751 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ec2f6c8b2e7e3e9caf124b2f0fccc47254c3bcab9732c1920ed13d0730b4accf

Height

#2,991,775

Difficulty

11.260661

Transactions

18

Size

6.20 KB

Version

2

Bits

0b42bab2

Nonce

772,642,189

Timestamp

1/2/2019, 2:23:58 AM

Confirmations

3,850,751

Merkle Root

f099bc9b97fda9fe6e604ec97db2ce1ca7c9c85e9c240639ec1cc06623d59db3
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.318 × 10⁹⁷(98-digit number)
13185345624261478042…66319900188935843839
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.318 × 10⁹⁷(98-digit number)
13185345624261478042…66319900188935843839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.637 × 10⁹⁷(98-digit number)
26370691248522956084…32639800377871687679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.274 × 10⁹⁷(98-digit number)
52741382497045912168…65279600755743375359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.054 × 10⁹⁸(99-digit number)
10548276499409182433…30559201511486750719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.109 × 10⁹⁸(99-digit number)
21096552998818364867…61118403022973501439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.219 × 10⁹⁸(99-digit number)
42193105997636729734…22236806045947002879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.438 × 10⁹⁸(99-digit number)
84386211995273459469…44473612091894005759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.687 × 10⁹⁹(100-digit number)
16877242399054691893…88947224183788011519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.375 × 10⁹⁹(100-digit number)
33754484798109383787…77894448367576023039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.750 × 10⁹⁹(100-digit number)
67508969596218767575…55788896735152046079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.350 × 10¹⁰⁰(101-digit number)
13501793919243753515…11577793470304092159
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,984,629 XPM·at block #6,842,525 · 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