Block #2,163,899

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/17/2017, 2:01:19 AM · Difficulty 10.8994 · 4,678,704 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b9623acc7007b3481e75b8a27fea040a3c0a8850163fa1f10885077428accf9a

Height

#2,163,899

Difficulty

10.899428

Transactions

3

Size

13.28 KB

Version

2

Bits

0ae640f0

Nonce

1,194,389,680

Timestamp

6/17/2017, 2:01:19 AM

Confirmations

4,678,704

Merkle Root

6c6f229a3502078612500abeddfb6ab19667b8483f94ef9488e3f6c9a508041e
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.

2.013 × 10⁹⁵(96-digit number)
20131745513981417520…77995528849829678879
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
2.013 × 10⁹⁵(96-digit number)
20131745513981417520…77995528849829678879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.026 × 10⁹⁵(96-digit number)
40263491027962835041…55991057699659357759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.052 × 10⁹⁵(96-digit number)
80526982055925670083…11982115399318715519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.610 × 10⁹⁶(97-digit number)
16105396411185134016…23964230798637431039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.221 × 10⁹⁶(97-digit number)
32210792822370268033…47928461597274862079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.442 × 10⁹⁶(97-digit number)
64421585644740536066…95856923194549724159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.288 × 10⁹⁷(98-digit number)
12884317128948107213…91713846389099448319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.576 × 10⁹⁷(98-digit number)
25768634257896214426…83427692778198896639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.153 × 10⁹⁷(98-digit number)
51537268515792428853…66855385556397793279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.030 × 10⁹⁸(99-digit number)
10307453703158485770…33710771112795586559
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,985,252 XPM·at block #6,842,602 · 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