Home/Chain Registry/Block #2,925,486

Block #2,925,486

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/16/2018, 1:56:12 PM · Difficulty 11.3537 · 3,917,277 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9a2282998d0f3be0024ab6dc88fe80593cc030b7b6b7c16a2b6b3dc0e974eaf5

Difficulty

11.353695

Transactions

11

Size

72.88 KB

Version

2

Bits

0b5a8bc8

Nonce

1,218,320,536

Timestamp

11/16/2018, 1:56:12 PM

Confirmations

3,917,277

Merkle Root

e8221ebdc60d8e1113c8aff1ad51d397f6762c7da49fd52f554a9f8496e579e5
Transactions (11)
1 in → 1 out8.5400 XPM110 B
50 in → 1 out233.7888 XPM7.27 KB
50 in → 1 out207.6478 XPM7.26 KB
50 in → 1 out226.6961 XPM7.26 KB
50 in → 1 out222.3580 XPM7.27 KB
50 in → 1 out219.8330 XPM7.27 KB
50 in → 1 out246.3279 XPM7.27 KB
50 in → 1 out216.5295 XPM7.27 KB
50 in → 1 out246.9208 XPM7.27 KB
50 in → 1 out212.5334 XPM7.28 KB
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.

8.651 × 10⁹¹(92-digit number)
86517631526867880400…15363789196160803480
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
8.651 × 10⁹¹(92-digit number)
86517631526867880400…15363789196160803481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.730 × 10⁹²(93-digit number)
17303526305373576080…30727578392321606961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.460 × 10⁹²(93-digit number)
34607052610747152160…61455156784643213921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.921 × 10⁹²(93-digit number)
69214105221494304320…22910313569286427841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.384 × 10⁹³(94-digit number)
13842821044298860864…45820627138572855681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.768 × 10⁹³(94-digit number)
27685642088597721728…91641254277145711361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.537 × 10⁹³(94-digit number)
55371284177195443456…83282508554291422721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.107 × 10⁹⁴(95-digit number)
11074256835439088691…66565017108582845441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.214 × 10⁹⁴(95-digit number)
22148513670878177382…33130034217165690881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.429 × 10⁹⁴(95-digit number)
44297027341756354765…66260068434331381761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.859 × 10⁹⁴(95-digit number)
88594054683512709530…32520136868662763521
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the Second 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.

View full Prime Chain Discovery page →
★★★☆☆
Rarity
RareChain length 11
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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Verify on a Primecoin Node

Anyone running a Primecoin node can independently verify this block using the following RPC commands. Run these from the primecoin-cli command line or via the debug console in the Primecoin wallet.

1. Get block hash by height
getblockhash 2925486

Returns the block hash for a given block height. Use this to confirm the hash shown above matches the chain.

2. Get full block data
getblock 9a2282998d0f3be0024ab6dc88fe80593cc030b7b6b7c16a2b6b3dc0e974eaf5

Returns the full block header including difficulty, prime chain origin, prime chain type, transaction IDs, and all other fields shown on this page.

How to run these commands: To verify this data independently, open a terminal on your own Primecoin node and run primecoin-cli <command>. Alternatively, open the Primecoin-Qt wallet, go to Help → Debug Window → Console, and type the command directly. The node must be fully synced to this block height for the commands to return results.

Cross-reference on Chainz Explorer

Chainz is an independent Primecoin block explorer. Compare this block's data to verify accuracy.

View Block #2,925,486 on Chainz ↗
Circulating Supply:57,986,442 XPM·at block #6,842,762 · 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