Block #2,168,779

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/20/2017, 12:17:36 PM · Difficulty 10.8984 · 4,648,086 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a82aefda855781b6463e741cf41803fdc6e1d7a84ccc24967a59fedab2216cd8

Height

#2,168,779

Difficulty

10.898432

Transactions

2

Size

5.32 KB

Version

2

Bits

0ae5ffa0

Nonce

1,029,067,288

Timestamp

6/20/2017, 12:17:36 PM

Confirmations

4,648,086

Merkle Root

b4731b94feb0afc6ac063a367c48a3a1157019affd575277b12cc7362625011d
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.238 × 10⁹⁵(96-digit number)
12385337578564343805…05266978233844451201
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.238 × 10⁹⁵(96-digit number)
12385337578564343805…05266978233844451201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.477 × 10⁹⁵(96-digit number)
24770675157128687610…10533956467688902401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.954 × 10⁹⁵(96-digit number)
49541350314257375221…21067912935377804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.908 × 10⁹⁵(96-digit number)
99082700628514750443…42135825870755609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.981 × 10⁹⁶(97-digit number)
19816540125702950088…84271651741511219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.963 × 10⁹⁶(97-digit number)
39633080251405900177…68543303483022438401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.926 × 10⁹⁶(97-digit number)
79266160502811800354…37086606966044876801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.585 × 10⁹⁷(98-digit number)
15853232100562360070…74173213932089753601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.170 × 10⁹⁷(98-digit number)
31706464201124720141…48346427864179507201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.341 × 10⁹⁷(98-digit number)
63412928402249440283…96692855728359014401
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,778,964 XPM·at block #6,816,864 · 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