Block #2,162,819

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/16/2017, 6:57:15 AM · Difficulty 10.9007 · 4,653,493 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1285771aa83a009676521777ba2aa6cd70c361f2e3fbdd0296bbebdba32ac8f2

Height

#2,162,819

Difficulty

10.900672

Transactions

4

Size

13.25 KB

Version

2

Bits

0ae6926b

Nonce

17,843,088

Timestamp

6/16/2017, 6:57:15 AM

Confirmations

4,653,493

Merkle Root

a6b6982ebfa36d3230865796639127b22c044336ec0c6c79cf4f0d6e854fe294
Transactions (4)
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.825 × 10⁹⁵(96-digit number)
18252906070153792730…48807709761302756479
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.825 × 10⁹⁵(96-digit number)
18252906070153792730…48807709761302756479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.650 × 10⁹⁵(96-digit number)
36505812140307585461…97615419522605512959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.301 × 10⁹⁵(96-digit number)
73011624280615170922…95230839045211025919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.460 × 10⁹⁶(97-digit number)
14602324856123034184…90461678090422051839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.920 × 10⁹⁶(97-digit number)
29204649712246068369…80923356180844103679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.840 × 10⁹⁶(97-digit number)
58409299424492136738…61846712361688207359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.168 × 10⁹⁷(98-digit number)
11681859884898427347…23693424723376414719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.336 × 10⁹⁷(98-digit number)
23363719769796854695…47386849446752829439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.672 × 10⁹⁷(98-digit number)
46727439539593709390…94773698893505658879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.345 × 10⁹⁷(98-digit number)
93454879079187418781…89547397787011317759
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,774,615 XPM·at block #6,816,311 · 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