Block #2,701,676

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/12/2018, 3:20:29 AM · Difficulty 11.6286 · 4,131,741 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
34be9fe650932945d72a0687070e96616956b3248494b8fbfa8cfd763f403d5e

Height

#2,701,676

Difficulty

11.628623

Transactions

2

Size

687 B

Version

2

Bits

0ba0ed73

Nonce

1,765,754,614

Timestamp

6/12/2018, 3:20:29 AM

Confirmations

4,131,741

Merkle Root

fbe507ac781063ae1de23d50fa9f500cf947249b5fbf1dfcfbdc728cc0bc06d9
Transactions (2)
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.069 × 10⁹⁷(98-digit number)
10690158509966429044…36192146907384412159
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.069 × 10⁹⁷(98-digit number)
10690158509966429044…36192146907384412159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.138 × 10⁹⁷(98-digit number)
21380317019932858088…72384293814768824319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.276 × 10⁹⁷(98-digit number)
42760634039865716176…44768587629537648639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.552 × 10⁹⁷(98-digit number)
85521268079731432353…89537175259075297279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.710 × 10⁹⁸(99-digit number)
17104253615946286470…79074350518150594559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.420 × 10⁹⁸(99-digit number)
34208507231892572941…58148701036301189119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.841 × 10⁹⁸(99-digit number)
68417014463785145882…16297402072602378239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.368 × 10⁹⁹(100-digit number)
13683402892757029176…32594804145204756479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.736 × 10⁹⁹(100-digit number)
27366805785514058353…65189608290409512959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.473 × 10⁹⁹(100-digit number)
54733611571028116706…30379216580819025919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.094 × 10¹⁰⁰(101-digit number)
10946722314205623341…60758433161638051839
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,911,538 XPM·at block #6,833,416 · 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