Block #3,086,738

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/10/2019, 10:29:54 AM · Difficulty 11.0378 · 3,752,756 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f260b087ff89924ef7992213f8cd1c953437d3c25d124eb26dd9f6f67ffe1a9c

Height

#3,086,738

Difficulty

11.037788

Transactions

5

Size

2.06 KB

Version

2

Bits

0b09ac79

Nonce

1,388,136,364

Timestamp

3/10/2019, 10:29:54 AM

Confirmations

3,752,756

Merkle Root

52f22804acf78f6c5cb337669644c5f70998816212ef2c0a587179f73f6fcf6d
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.501 × 10⁹⁵(96-digit number)
15012808064366203730…68408897048100440319
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.501 × 10⁹⁵(96-digit number)
15012808064366203730…68408897048100440319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.002 × 10⁹⁵(96-digit number)
30025616128732407461…36817794096200880639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.005 × 10⁹⁵(96-digit number)
60051232257464814922…73635588192401761279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.201 × 10⁹⁶(97-digit number)
12010246451492962984…47271176384803522559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.402 × 10⁹⁶(97-digit number)
24020492902985925969…94542352769607045119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.804 × 10⁹⁶(97-digit number)
48040985805971851938…89084705539214090239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.608 × 10⁹⁶(97-digit number)
96081971611943703876…78169411078428180479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.921 × 10⁹⁷(98-digit number)
19216394322388740775…56338822156856360959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.843 × 10⁹⁷(98-digit number)
38432788644777481550…12677644313712721919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.686 × 10⁹⁷(98-digit number)
76865577289554963100…25355288627425443839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.537 × 10⁹⁸(99-digit number)
15373115457910992620…50710577254850887679
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,960,248 XPM·at block #6,839,493 · 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