Block #2,146,303

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/5/2017, 2:41:21 AM · Difficulty 10.8915 · 4,696,849 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9c2fd7fb66930aa154904724d898f3c410a9a252c69ef32fdc0fb549dbee7a6f

Height

#2,146,303

Difficulty

10.891452

Transactions

2

Size

3.02 KB

Version

2

Bits

0ae43631

Nonce

519,193,883

Timestamp

6/5/2017, 2:41:21 AM

Confirmations

4,696,849

Merkle Root

1826595a92f8e98d96b12f7c623bb8c84298c002a10f4d824330fa19fc8f92b7
Transactions (2)
1 in → 1 out8.4500 XPM110 B
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.707 × 10⁹⁵(96-digit number)
97075800874083171470…69445751124750616319
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.707 × 10⁹⁵(96-digit number)
97075800874083171470…69445751124750616319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.941 × 10⁹⁶(97-digit number)
19415160174816634294…38891502249501232639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.883 × 10⁹⁶(97-digit number)
38830320349633268588…77783004499002465279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.766 × 10⁹⁶(97-digit number)
77660640699266537176…55566008998004930559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.553 × 10⁹⁷(98-digit number)
15532128139853307435…11132017996009861119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.106 × 10⁹⁷(98-digit number)
31064256279706614870…22264035992019722239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.212 × 10⁹⁷(98-digit number)
62128512559413229741…44528071984039444479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.242 × 10⁹⁸(99-digit number)
12425702511882645948…89056143968078888959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.485 × 10⁹⁸(99-digit number)
24851405023765291896…78112287936157777919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.970 × 10⁹⁸(99-digit number)
49702810047530583793…56224575872315555839
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,989,581 XPM·at block #6,843,151 · 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