Block #2,173,991

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/23/2017, 4:46:08 PM · Difficulty 10.9104 · 4,669,896 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8cad70c0c7bd659f87c0e4ee425962085defd0f3bf3d95005fb395cbb07613b8

Height

#2,173,991

Difficulty

10.910419

Transactions

25

Size

5.51 KB

Version

2

Bits

0ae91136

Nonce

1,610,402,673

Timestamp

6/23/2017, 4:46:08 PM

Confirmations

4,669,896

Merkle Root

216e5c3e82bfff6ae1ea383a991d8253bb11ba309680fe0b896e91c8c6d5d478
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.

9.540 × 10⁹³(94-digit number)
95405450448721675471…21243386191998466181
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
9.540 × 10⁹³(94-digit number)
95405450448721675471…21243386191998466181
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.908 × 10⁹⁴(95-digit number)
19081090089744335094…42486772383996932361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.816 × 10⁹⁴(95-digit number)
38162180179488670188…84973544767993864721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.632 × 10⁹⁴(95-digit number)
76324360358977340377…69947089535987729441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.526 × 10⁹⁵(96-digit number)
15264872071795468075…39894179071975458881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.052 × 10⁹⁵(96-digit number)
30529744143590936150…79788358143950917761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.105 × 10⁹⁵(96-digit number)
61059488287181872301…59576716287901835521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.221 × 10⁹⁶(97-digit number)
12211897657436374460…19153432575803671041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.442 × 10⁹⁶(97-digit number)
24423795314872748920…38306865151607342081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.884 × 10⁹⁶(97-digit number)
48847590629745497841…76613730303214684161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.769 × 10⁹⁶(97-digit number)
97695181259490995683…53227460606429368321
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,995,465 XPM·at block #6,843,886 · 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