Block #2,142,193

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/2/2017, 6:18:29 PM · Difficulty 10.8745 · 4,688,483 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fe92aab0f48bae80d7c111c87e4e5631cf9e0dd89c2b7007249fc73f014cba41

Height

#2,142,193

Difficulty

10.874492

Transactions

3

Size

945 B

Version

2

Bits

0adfdeb0

Nonce

521,354,285

Timestamp

6/2/2017, 6:18:29 PM

Confirmations

4,688,483

Merkle Root

0611fa2302c44359cb265983da6ec064d479a83cf67fa1ae7e9a52b4b4f89121
Transactions (3)
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.

1.288 × 10⁹⁴(95-digit number)
12889004475691028310…80263298568503780199
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
1.288 × 10⁹⁴(95-digit number)
12889004475691028310…80263298568503780199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.577 × 10⁹⁴(95-digit number)
25778008951382056620…60526597137007560399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.155 × 10⁹⁴(95-digit number)
51556017902764113240…21053194274015120799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.031 × 10⁹⁵(96-digit number)
10311203580552822648…42106388548030241599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.062 × 10⁹⁵(96-digit number)
20622407161105645296…84212777096060483199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.124 × 10⁹⁵(96-digit number)
41244814322211290592…68425554192120966399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.248 × 10⁹⁵(96-digit number)
82489628644422581184…36851108384241932799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.649 × 10⁹⁶(97-digit number)
16497925728884516236…73702216768483865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.299 × 10⁹⁶(97-digit number)
32995851457769032473…47404433536967731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.599 × 10⁹⁶(97-digit number)
65991702915538064947…94808867073935462399
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,889,537 XPM·at block #6,830,675 · 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