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

Block #2,925,439

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/16/2018, 1:02:50 PM · Difficulty 11.3544 · 3,918,292 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7cc8b8d8997f3b89266fb44807e1444e60b2cd9ef5b0c405254ac0341e4987da

Difficulty

11.354432

Transactions

11

Size

72.88 KB

Version

2

Bits

0b5abc15

Nonce

367,197,578

Timestamp

11/16/2018, 1:02:50 PM

Confirmations

3,918,292

Merkle Root

3fd6ffee0831e60af9e58720d908fe6395661198ce09039e6c05ff18e35bc37e
Transactions (11)
1 in → 1 out8.5400 XPM110 B
50 in → 1 out226.6625 XPM7.27 KB
50 in → 1 out221.4637 XPM7.27 KB
50 in → 1 out240.4336 XPM7.27 KB
50 in → 1 out237.2144 XPM7.27 KB
50 in → 1 out224.1716 XPM7.26 KB
50 in → 1 out211.5462 XPM7.26 KB
50 in → 1 out231.9293 XPM7.27 KB
50 in → 1 out230.4523 XPM7.27 KB
50 in → 1 out218.4880 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.

1.370 × 10⁹³(94-digit number)
13708055658414495951…03516930306536791200
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.370 × 10⁹³(94-digit number)
13708055658414495951…03516930306536791201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.741 × 10⁹³(94-digit number)
27416111316828991902…07033860613073582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.483 × 10⁹³(94-digit number)
54832222633657983804…14067721226147164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.096 × 10⁹⁴(95-digit number)
10966444526731596760…28135442452294329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.193 × 10⁹⁴(95-digit number)
21932889053463193521…56270884904588659201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.386 × 10⁹⁴(95-digit number)
43865778106926387043…12541769809177318401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.773 × 10⁹⁴(95-digit number)
87731556213852774087…25083539618354636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.754 × 10⁹⁵(96-digit number)
17546311242770554817…50167079236709273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.509 × 10⁹⁵(96-digit number)
35092622485541109634…00334158473418547201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.018 × 10⁹⁵(96-digit number)
70185244971082219269…00668316946837094401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.403 × 10⁹⁶(97-digit number)
14037048994216443853…01336633893674188801
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 2925439

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 7cc8b8d8997f3b89266fb44807e1444e60b2cd9ef5b0c405254ac0341e4987da

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,439 on Chainz ↗
Circulating Supply:57,994,220 XPM·at block #6,843,730 · 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