Block #1,706,228

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/7/2016, 8:09:20 AM · Difficulty 10.6471 · 5,118,885 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ab0d502db4e99cfa85d52e392e79ada4f6d435b211db082271dba06636171ecd

Height

#1,706,228

Difficulty

10.647107

Transactions

7

Size

11.14 KB

Version

2

Bits

0aa5a8c6

Nonce

1,016,289,749

Timestamp

8/7/2016, 8:09:20 AM

Confirmations

5,118,885

Merkle Root

fae6c61155e5825816863b39fa1884712d1097485e32a3862c33ce210f0819fc
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.

4.655 × 10⁹³(94-digit number)
46550824179917264045…28988133500745900391
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
4.655 × 10⁹³(94-digit number)
46550824179917264045…28988133500745900391
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.310 × 10⁹³(94-digit number)
93101648359834528090…57976267001491800781
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.862 × 10⁹⁴(95-digit number)
18620329671966905618…15952534002983601561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.724 × 10⁹⁴(95-digit number)
37240659343933811236…31905068005967203121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.448 × 10⁹⁴(95-digit number)
74481318687867622472…63810136011934406241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.489 × 10⁹⁵(96-digit number)
14896263737573524494…27620272023868812481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.979 × 10⁹⁵(96-digit number)
29792527475147048989…55240544047737624961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.958 × 10⁹⁵(96-digit number)
59585054950294097978…10481088095475249921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.191 × 10⁹⁶(97-digit number)
11917010990058819595…20962176190950499841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.383 × 10⁹⁶(97-digit number)
23834021980117639191…41924352381900999681
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,986 XPM·at block #6,825,112 · 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