Block #2,797,399

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/17/2018, 4:05:11 AM · Difficulty 11.6758 · 4,034,046 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
adf54ed082ec1a70dadce6c3500665ea857889de6022c9bfee65956b9d5c2f40

Height

#2,797,399

Difficulty

11.675752

Transactions

3

Size

1.22 KB

Version

2

Bits

0bacfe0f

Nonce

1,145,758,485

Timestamp

8/17/2018, 4:05:11 AM

Confirmations

4,034,046

Merkle Root

756f04ec7b45739a69f1009c9a80657db8f62a3010e2bf5355ac65b0ab852fe1
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.

3.682 × 10⁹⁷(98-digit number)
36827574766732695678…36072239769763409919
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
3.682 × 10⁹⁷(98-digit number)
36827574766732695678…36072239769763409919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.365 × 10⁹⁷(98-digit number)
73655149533465391357…72144479539526819839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.473 × 10⁹⁸(99-digit number)
14731029906693078271…44288959079053639679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.946 × 10⁹⁸(99-digit number)
29462059813386156542…88577918158107279359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.892 × 10⁹⁸(99-digit number)
58924119626772313085…77155836316214558719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.178 × 10⁹⁹(100-digit number)
11784823925354462617…54311672632429117439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.356 × 10⁹⁹(100-digit number)
23569647850708925234…08623345264858234879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.713 × 10⁹⁹(100-digit number)
47139295701417850468…17246690529716469759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.427 × 10⁹⁹(100-digit number)
94278591402835700937…34493381059432939519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.885 × 10¹⁰⁰(101-digit number)
18855718280567140187…68986762118865879039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.771 × 10¹⁰⁰(101-digit number)
37711436561134280374…37973524237731758079
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,895,724 XPM·at block #6,831,444 · 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