Block #2,697,895

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/9/2018, 7:09:36 AM · Difficulty 11.6507 · 4,136,110 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2d5a79e7000907af2d6f1ab8ca1f9352e964b7cd5e7972d57f3ff99600fe2187

Height

#2,697,895

Difficulty

11.650662

Transactions

5

Size

1.60 KB

Version

2

Bits

0ba691c6

Nonce

1,036,963,954

Timestamp

6/9/2018, 7:09:36 AM

Confirmations

4,136,110

Merkle Root

e6cf952d1ee15895a1d2173cd982258435730f862bd0de26e269b6ac0df03608
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.

8.468 × 10⁹⁷(98-digit number)
84689794984711182530…48912856207298559999
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
8.468 × 10⁹⁷(98-digit number)
84689794984711182530…48912856207298559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.693 × 10⁹⁸(99-digit number)
16937958996942236506…97825712414597119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.387 × 10⁹⁸(99-digit number)
33875917993884473012…95651424829194239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.775 × 10⁹⁸(99-digit number)
67751835987768946024…91302849658388479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.355 × 10⁹⁹(100-digit number)
13550367197553789204…82605699316776959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.710 × 10⁹⁹(100-digit number)
27100734395107578409…65211398633553919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.420 × 10⁹⁹(100-digit number)
54201468790215156819…30422797267107839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.084 × 10¹⁰⁰(101-digit number)
10840293758043031363…60845594534215679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.168 × 10¹⁰⁰(101-digit number)
21680587516086062727…21691189068431359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.336 × 10¹⁰⁰(101-digit number)
43361175032172125455…43382378136862719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.672 × 10¹⁰⁰(101-digit number)
86722350064344250911…86764756273725439999
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,916,267 XPM·at block #6,834,004 · 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