Block #2,346,586

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/22/2017, 7:00:23 AM · Difficulty 10.8992 · 4,487,312 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d132f59d0026a0b052a5a87c30ef090043b479c53a089fd4345dbe2302cdc2bc

Height

#2,346,586

Difficulty

10.899182

Transactions

2

Size

54.18 KB

Version

2

Bits

0ae630d2

Nonce

104,053,931

Timestamp

10/22/2017, 7:00:23 AM

Confirmations

4,487,312

Merkle Root

2557d36f332781068e413f432e47e77950c97112801e009921af0814c942f2d4
Transactions (2)
1 in → 1 out8.9600 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.

1.123 × 10⁹⁴(95-digit number)
11232425930642328727…16439324258962472039
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.123 × 10⁹⁴(95-digit number)
11232425930642328727…16439324258962472039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.246 × 10⁹⁴(95-digit number)
22464851861284657455…32878648517924944079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.492 × 10⁹⁴(95-digit number)
44929703722569314911…65757297035849888159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.985 × 10⁹⁴(95-digit number)
89859407445138629823…31514594071699776319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.797 × 10⁹⁵(96-digit number)
17971881489027725964…63029188143399552639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.594 × 10⁹⁵(96-digit number)
35943762978055451929…26058376286799105279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.188 × 10⁹⁵(96-digit number)
71887525956110903859…52116752573598210559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.437 × 10⁹⁶(97-digit number)
14377505191222180771…04233505147196421119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.875 × 10⁹⁶(97-digit number)
28755010382444361543…08467010294392842239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.751 × 10⁹⁶(97-digit number)
57510020764888723087…16934020588785684479
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,915,409 XPM·at block #6,833,897 · 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