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

Block #2,925,223

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/16/2018, 9:25:29 AM · Difficulty 11.3548 · 3,917,695 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5c659986e5edbb56263fa593faad57cd10d22f10a205330d6458f53a58c11c60

Difficulty

11.354755

Transactions

11

Size

72.85 KB

Version

2

Bits

0b5ad133

Nonce

924,576,979

Timestamp

11/16/2018, 9:25:29 AM

Confirmations

3,917,695

Merkle Root

b068b0e0411f0395db92be4aa2045b3caff4e40822c98d239553a0a84111236e
Transactions (11)
1 in → 1 out8.5400 XPM109 B
50 in → 1 out232.5535 XPM7.27 KB
50 in → 1 out224.9164 XPM7.27 KB
50 in → 1 out214.3872 XPM7.26 KB
50 in → 1 out232.6281 XPM7.26 KB
50 in → 1 out209.1892 XPM7.26 KB
50 in → 1 out213.5438 XPM7.26 KB
50 in → 1 out221.9410 XPM7.26 KB
50 in → 1 out226.6749 XPM7.27 KB
50 in → 1 out214.1537 XPM7.27 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.

7.516 × 10⁹⁵(96-digit number)
75169539357997209520…69200226654675435520
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
7.516 × 10⁹⁵(96-digit number)
75169539357997209520…69200226654675435521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.503 × 10⁹⁶(97-digit number)
15033907871599441904…38400453309350871041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.006 × 10⁹⁶(97-digit number)
30067815743198883808…76800906618701742081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.013 × 10⁹⁶(97-digit number)
60135631486397767616…53601813237403484161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.202 × 10⁹⁷(98-digit number)
12027126297279553523…07203626474806968321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.405 × 10⁹⁷(98-digit number)
24054252594559107046…14407252949613936641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.810 × 10⁹⁷(98-digit number)
48108505189118214092…28814505899227873281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.621 × 10⁹⁷(98-digit number)
96217010378236428185…57629011798455746561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.924 × 10⁹⁸(99-digit number)
19243402075647285637…15258023596911493121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.848 × 10⁹⁸(99-digit number)
38486804151294571274…30516047193822986241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.697 × 10⁹⁸(99-digit number)
76973608302589142548…61032094387645972481
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 2925223

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 5c659986e5edbb56263fa593faad57cd10d22f10a205330d6458f53a58c11c60

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,223 on Chainz ↗
Circulating Supply:57,987,691 XPM·at block #6,842,917 · 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