Block #2,766,151

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/26/2018, 1:02:27 PM · Difficulty 11.6679 · 4,074,787 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f0dd81bd4caf159b421ca9b8c3617dc6aae60fd1b938d954b45b4bdf8e57cd31

Height

#2,766,151

Difficulty

11.667929

Transactions

3

Size

1.81 KB

Version

2

Bits

0baafd64

Nonce

966,216,300

Timestamp

7/26/2018, 1:02:27 PM

Confirmations

4,074,787

Merkle Root

1d7592aaf85feeb13b1d0138fcc2e0c391489e2b987c846674fb890bf8bf6642
Transactions (3)
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.

5.773 × 10⁹⁶(97-digit number)
57731126714633958188…83388815065019692799
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
5.773 × 10⁹⁶(97-digit number)
57731126714633958188…83388815065019692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.154 × 10⁹⁷(98-digit number)
11546225342926791637…66777630130039385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.309 × 10⁹⁷(98-digit number)
23092450685853583275…33555260260078771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.618 × 10⁹⁷(98-digit number)
46184901371707166551…67110520520157542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.236 × 10⁹⁷(98-digit number)
92369802743414333102…34221041040315084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.847 × 10⁹⁸(99-digit number)
18473960548682866620…68442082080630169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.694 × 10⁹⁸(99-digit number)
36947921097365733240…36884164161260339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.389 × 10⁹⁸(99-digit number)
73895842194731466481…73768328322520678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.477 × 10⁹⁹(100-digit number)
14779168438946293296…47536656645041356799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.955 × 10⁹⁹(100-digit number)
29558336877892586592…95073313290082713599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.911 × 10⁹⁹(100-digit number)
59116673755785173185…90146626580165427199
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,971,858 XPM·at block #6,840,937 · 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