Block #2,173,195

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/23/2017, 4:15:29 AM · Difficulty 10.9096 · 4,652,919 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
82600f3b1839c745e48983c6d68bef4668341e05a4967f12a4e07e6975972ea4

Height

#2,173,195

Difficulty

10.909572

Transactions

12

Size

3.39 KB

Version

2

Bits

0ae8d9bd

Nonce

599,935,272

Timestamp

6/23/2017, 4:15:29 AM

Confirmations

4,652,919

Merkle Root

19dde0c1d058936022f9822102d585e286fb99cd6dab482727261a2a9bac1b2a
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.

7.088 × 10⁹⁴(95-digit number)
70883150889397254104…81049292705008019681
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
7.088 × 10⁹⁴(95-digit number)
70883150889397254104…81049292705008019681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.417 × 10⁹⁵(96-digit number)
14176630177879450820…62098585410016039361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.835 × 10⁹⁵(96-digit number)
28353260355758901641…24197170820032078721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.670 × 10⁹⁵(96-digit number)
56706520711517803283…48394341640064157441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.134 × 10⁹⁶(97-digit number)
11341304142303560656…96788683280128314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.268 × 10⁹⁶(97-digit number)
22682608284607121313…93577366560256629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.536 × 10⁹⁶(97-digit number)
45365216569214242626…87154733120513259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.073 × 10⁹⁶(97-digit number)
90730433138428485253…74309466241026519041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.814 × 10⁹⁷(98-digit number)
18146086627685697050…48618932482053038081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.629 × 10⁹⁷(98-digit number)
36292173255371394101…97237864964106076161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.258 × 10⁹⁷(98-digit number)
72584346510742788202…94475729928212152321
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,853,037 XPM·at block #6,826,113 · 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