Block #1,627,188

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/13/2016, 10:34:45 PM · Difficulty 10.5896 · 5,197,835 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
acd29b1c8a4d584e7cbb97323f6144057b48ec00a53e0cd226054b0d966c51a3

Height

#1,627,188

Difficulty

10.589576

Transactions

2

Size

2.04 KB

Version

2

Bits

0a96ee72

Nonce

556,571,422

Timestamp

6/13/2016, 10:34:45 PM

Confirmations

5,197,835

Merkle Root

5e9111cca23118d03e5b5389ce9c9750f6ad04ec37b0f03a903c1ee3a7cb8fc9
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.706 × 10⁹⁶(97-digit number)
27065567384741867255…58577179329386831361
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.706 × 10⁹⁶(97-digit number)
27065567384741867255…58577179329386831361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.413 × 10⁹⁶(97-digit number)
54131134769483734510…17154358658773662721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.082 × 10⁹⁷(98-digit number)
10826226953896746902…34308717317547325441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.165 × 10⁹⁷(98-digit number)
21652453907793493804…68617434635094650881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.330 × 10⁹⁷(98-digit number)
43304907815586987608…37234869270189301761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.660 × 10⁹⁷(98-digit number)
86609815631173975217…74469738540378603521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.732 × 10⁹⁸(99-digit number)
17321963126234795043…48939477080757207041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.464 × 10⁹⁸(99-digit number)
34643926252469590086…97878954161514414081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.928 × 10⁹⁸(99-digit number)
69287852504939180173…95757908323028828161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.385 × 10⁹⁹(100-digit number)
13857570500987836034…91515816646057656321
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,844,267 XPM·at block #6,825,022 · 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