Block #2,173,992

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/23/2017, 4:48:21 PM · Difficulty 10.9104 · 4,669,095 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6f9d044dff2de3f8840c431fd7b8f2e0d01fcfe1e9e042bef267465dd1f4012d

Height

#2,173,992

Difficulty

10.910409

Transactions

32

Size

13.11 KB

Version

2

Bits

0ae91093

Nonce

660,087,047

Timestamp

6/23/2017, 4:48:21 PM

Confirmations

4,669,095

Merkle Root

fcf4067932492a3156a82694558b3a951ee469de0b8b84365d4061891191897e
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.157 × 10⁹⁵(96-digit number)
41578092421335404151…44240700618619119359
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.157 × 10⁹⁵(96-digit number)
41578092421335404151…44240700618619119359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.315 × 10⁹⁵(96-digit number)
83156184842670808302…88481401237238238719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.663 × 10⁹⁶(97-digit number)
16631236968534161660…76962802474476477439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.326 × 10⁹⁶(97-digit number)
33262473937068323321…53925604948952954879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.652 × 10⁹⁶(97-digit number)
66524947874136646642…07851209897905909759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.330 × 10⁹⁷(98-digit number)
13304989574827329328…15702419795811819519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.660 × 10⁹⁷(98-digit number)
26609979149654658656…31404839591623639039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.321 × 10⁹⁷(98-digit number)
53219958299309317313…62809679183247278079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.064 × 10⁹⁸(99-digit number)
10643991659861863462…25619358366494556159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.128 × 10⁹⁸(99-digit number)
21287983319723726925…51238716732989112319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.257 × 10⁹⁸(99-digit number)
42575966639447453851…02477433465978224639
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,989,058 XPM·at block #6,843,086 · 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