Block #2,128,302

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/22/2017, 5:12:54 PM · Difficulty 10.9155 · 4,686,709 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8f379c91b7e3280072f04109826fe078c6cbf3d3994fad229871c0bd26741682

Height

#2,128,302

Difficulty

10.915469

Transactions

3

Size

2.48 KB

Version

2

Bits

0aea5c2b

Nonce

2,080,749,325

Timestamp

5/22/2017, 5:12:54 PM

Confirmations

4,686,709

Merkle Root

61518cc15ccc3e83781768df25b3a37248c2f7b9006a7a3bb41e53ab9a8d8be1
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.058 × 10⁹⁵(96-digit number)
10584649213101991451…75590277211142540639
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.058 × 10⁹⁵(96-digit number)
10584649213101991451…75590277211142540639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.116 × 10⁹⁵(96-digit number)
21169298426203982903…51180554422285081279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.233 × 10⁹⁵(96-digit number)
42338596852407965807…02361108844570162559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.467 × 10⁹⁵(96-digit number)
84677193704815931615…04722217689140325119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.693 × 10⁹⁶(97-digit number)
16935438740963186323…09444435378280650239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.387 × 10⁹⁶(97-digit number)
33870877481926372646…18888870756561300479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.774 × 10⁹⁶(97-digit number)
67741754963852745292…37777741513122600959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.354 × 10⁹⁷(98-digit number)
13548350992770549058…75555483026245201919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.709 × 10⁹⁷(98-digit number)
27096701985541098117…51110966052490403839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.419 × 10⁹⁷(98-digit number)
54193403971082196234…02221932104980807679
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,764,177 XPM·at block #6,815,010 · 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