Block #1,684,004

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/22/2016, 12:45:31 AM · Difficulty 10.7243 · 5,132,842 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1563746087d56bd9226efb1c6e73f6428a0993f6a8029af91f8669dcc520a1d9

Height

#1,684,004

Difficulty

10.724279

Transactions

2

Size

9.24 KB

Version

2

Bits

0ab96a56

Nonce

923,995,664

Timestamp

7/22/2016, 12:45:31 AM

Confirmations

5,132,842

Merkle Root

ce041a0c16593fc35d46a2ae407b58e1964b754689c90fc7de6d9d1442cd8e7b
Transactions (2)
1 in → 1 out8.8600 XPM110 B
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.694 × 10⁹⁶(97-digit number)
26948181576838843877…77364789964212976641
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.694 × 10⁹⁶(97-digit number)
26948181576838843877…77364789964212976641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.389 × 10⁹⁶(97-digit number)
53896363153677687754…54729579928425953281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.077 × 10⁹⁷(98-digit number)
10779272630735537550…09459159856851906561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.155 × 10⁹⁷(98-digit number)
21558545261471075101…18918319713703813121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.311 × 10⁹⁷(98-digit number)
43117090522942150203…37836639427407626241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.623 × 10⁹⁷(98-digit number)
86234181045884300407…75673278854815252481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.724 × 10⁹⁸(99-digit number)
17246836209176860081…51346557709630504961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.449 × 10⁹⁸(99-digit number)
34493672418353720162…02693115419261009921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.898 × 10⁹⁸(99-digit number)
68987344836707440325…05386230838522019841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.379 × 10⁹⁹(100-digit number)
13797468967341488065…10772461677044039681
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,809 XPM·at block #6,816,845 · 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