Block #2,146,856

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/5/2017, 11:15:25 AM · Difficulty 10.8923 · 4,695,401 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4889c2361ce7d00ef1987ddad68e1bdfc4853f98288e933e93580ef4daf59dfc

Height

#2,146,856

Difficulty

10.892320

Transactions

3

Size

1.04 KB

Version

2

Bits

0ae46f11

Nonce

1,406,046,498

Timestamp

6/5/2017, 11:15:25 AM

Confirmations

4,695,401

Merkle Root

0973eaf40faeec83937883b5582948d51cdd2018f24d01377f27b5039f046083
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.

3.579 × 10⁹⁶(97-digit number)
35790062058283084710…54861224279490887679
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.579 × 10⁹⁶(97-digit number)
35790062058283084710…54861224279490887679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.158 × 10⁹⁶(97-digit number)
71580124116566169421…09722448558981775359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.431 × 10⁹⁷(98-digit number)
14316024823313233884…19444897117963550719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.863 × 10⁹⁷(98-digit number)
28632049646626467768…38889794235927101439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.726 × 10⁹⁷(98-digit number)
57264099293252935537…77779588471854202879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.145 × 10⁹⁸(99-digit number)
11452819858650587107…55559176943708405759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.290 × 10⁹⁸(99-digit number)
22905639717301174214…11118353887416811519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.581 × 10⁹⁸(99-digit number)
45811279434602348429…22236707774833623039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.162 × 10⁹⁸(99-digit number)
91622558869204696859…44473415549667246079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.832 × 10⁹⁹(100-digit number)
18324511773840939371…88946831099334492159
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,982,453 XPM·at block #6,842,256 · 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