Block #2,129,175

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/23/2017, 12:13:08 PM · Difficulty 10.9109 · 4,713,230 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
848c640df09db8c16d388bfcc0bd43c576fc6a5ef0ba7096acbe7782e5545ba7

Height

#2,129,175

Difficulty

10.910883

Transactions

2

Size

1.03 KB

Version

2

Bits

0ae92f9a

Nonce

92,138,259

Timestamp

5/23/2017, 12:13:08 PM

Confirmations

4,713,230

Merkle Root

447b76d674b1a0b299e2f62d7d87938dfde7b85bac2bbaa668b426a972ff3afe
Transactions (2)
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.822 × 10⁹¹(92-digit number)
28220961514655448630…42241867561322159999
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.822 × 10⁹¹(92-digit number)
28220961514655448630…42241867561322159999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.644 × 10⁹¹(92-digit number)
56441923029310897261…84483735122644319999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.128 × 10⁹²(93-digit number)
11288384605862179452…68967470245288639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.257 × 10⁹²(93-digit number)
22576769211724358904…37934940490577279999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.515 × 10⁹²(93-digit number)
45153538423448717809…75869880981154559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.030 × 10⁹²(93-digit number)
90307076846897435618…51739761962309119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.806 × 10⁹³(94-digit number)
18061415369379487123…03479523924618239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.612 × 10⁹³(94-digit number)
36122830738758974247…06959047849236479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.224 × 10⁹³(94-digit number)
72245661477517948494…13918095698472959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.444 × 10⁹⁴(95-digit number)
14449132295503589698…27836191396945919999
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 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
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 1CC formula:

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