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

Block #2,925,480

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/16/2018, 1:48:29 PM · Difficulty 11.3541 · 3,912,627 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ecd3ca3281460fc4746bfc277b41eb87daebfe2bc499a1eccf5a8b48f30b32c8

Difficulty

11.354105

Transactions

11

Size

72.89 KB

Version

2

Bits

0b5aa6a5

Nonce

201,709,082

Timestamp

11/16/2018, 1:48:29 PM

Confirmations

3,912,627

Merkle Root

de617ad1a539434d5b1b9a7afb482bd97f23ea17d73b9e7a484e8e2aa8a01daf
Transactions (11)
1 in → 1 out8.5400 XPM110 B
50 in → 1 out240.8103 XPM7.28 KB
50 in → 1 out223.4904 XPM7.27 KB
50 in → 1 out237.5242 XPM7.26 KB
50 in → 1 out212.2126 XPM7.28 KB
50 in → 1 out234.9260 XPM7.26 KB
50 in → 1 out219.1891 XPM7.27 KB
50 in → 1 out213.2823 XPM7.27 KB
50 in → 1 out234.0453 XPM7.27 KB
50 in → 1 out221.2141 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.

2.550 × 10⁹⁷(98-digit number)
25504593287925917141…47019138005601280000
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
2.550 × 10⁹⁷(98-digit number)
25504593287925917141…47019138005601280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.100 × 10⁹⁷(98-digit number)
51009186575851834283…94038276011202560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.020 × 10⁹⁸(99-digit number)
10201837315170366856…88076552022405120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.040 × 10⁹⁸(99-digit number)
20403674630340733713…76153104044810240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.080 × 10⁹⁸(99-digit number)
40807349260681467426…52306208089620480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.161 × 10⁹⁸(99-digit number)
81614698521362934853…04612416179240960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.632 × 10⁹⁹(100-digit number)
16322939704272586970…09224832358481920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.264 × 10⁹⁹(100-digit number)
32645879408545173941…18449664716963840001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.529 × 10⁹⁹(100-digit number)
65291758817090347883…36899329433927680001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.305 × 10¹⁰⁰(101-digit number)
13058351763418069576…73798658867855360001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.611 × 10¹⁰⁰(101-digit number)
26116703526836139153…47597317735710720001
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 2925480

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 ecd3ca3281460fc4746bfc277b41eb87daebfe2bc499a1eccf5a8b48f30b32c8

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,480 on Chainz ↗
Circulating Supply:57,949,210 XPM·at block #6,838,106 · 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