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

Block #2,925,445

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 11/16/2018, 1:09:33 PM · Difficulty 11.3546 · 3,919,315 confirmations

TWN
Bi-Twin Chain

Interleaved pairs of primes that differ by 2, forming twin prime pairs at each level.

Block Header
Block Hash
eeb0f3ef38c411cd8307071ec922b9de162f8b2ca43fe9420cffd8a745045903

Difficulty

11.354595

Transactions

12

Size

74.10 KB

Version

2

Bits

0b5ac6ba

Nonce

146,719,856

Timestamp

11/16/2018, 1:09:33 PM

Confirmations

3,919,315

Merkle Root

86d4b95ce585dbef189e52627d537107de02dddc9fd06268974b4bcbdd47e503
Transactions (12)
1 in → 1 out8.5600 XPM110 B
50 in → 1 out240.4213 XPM7.28 KB
50 in → 1 out228.9142 XPM7.27 KB
50 in → 1 out240.8872 XPM7.27 KB
50 in → 1 out227.0889 XPM7.27 KB
8 in → 1 out129.9452 XPM1.20 KB
50 in → 1 out237.1569 XPM7.27 KB
50 in → 1 out234.1680 XPM7.27 KB
50 in → 1 out211.8737 XPM7.27 KB
50 in → 1 out220.7605 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.

5.542 × 10⁹⁶(97-digit number)
55422666212168033603…94802159680491079680
Discovered Prime Numbers
Lower: 2^k × origin − 1 | Upper: 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.

Level 0 — Twin Prime Pair (origin ± 1)
origin − 1
5.542 × 10⁹⁶(97-digit number)
55422666212168033603…94802159680491079679
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
5.542 × 10⁹⁶(97-digit number)
55422666212168033603…94802159680491079681
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: origin + 1 − origin − 1 = 2 (twin primes ✓)
Level 1 — Twin Prime Pair (2^1 × origin ± 1)
2^1 × origin − 1
1.108 × 10⁹⁷(98-digit number)
11084533242433606720…89604319360982159359
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.108 × 10⁹⁷(98-digit number)
11084533242433606720…89604319360982159361
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^1 × origin + 1 − 2^1 × origin − 1 = 2 (twin primes ✓)
Level 2 — Twin Prime Pair (2^2 × origin ± 1)
2^2 × origin − 1
2.216 × 10⁹⁷(98-digit number)
22169066484867213441…79208638721964318719
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
2.216 × 10⁹⁷(98-digit number)
22169066484867213441…79208638721964318721
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^2 × origin + 1 − 2^2 × origin − 1 = 2 (twin primes ✓)
Level 3 — Twin Prime Pair (2^3 × origin ± 1)
2^3 × origin − 1
4.433 × 10⁹⁷(98-digit number)
44338132969734426883…58417277443928637439
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
4.433 × 10⁹⁷(98-digit number)
44338132969734426883…58417277443928637441
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^3 × origin + 1 − 2^3 × origin − 1 = 2 (twin primes ✓)
Level 4 — Twin Prime Pair (2^4 × origin ± 1)
2^4 × origin − 1
8.867 × 10⁹⁷(98-digit number)
88676265939468853766…16834554887857274879
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
8.867 × 10⁹⁷(98-digit number)
88676265939468853766…16834554887857274881
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^4 × origin + 1 − 2^4 × origin − 1 = 2 (twin primes ✓)
Level 5 — Twin Prime Pair (2^5 × origin ± 1)
2^5 × origin − 1
1.773 × 10⁹⁸(99-digit number)
17735253187893770753…33669109775714549759
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 Bi-Twin Chain. 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 TWN formula:

TWN: twin pairs (p, p+2) where p = origin/primorial − 1 and p+2 = origin/primorial + 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 2925445

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 eeb0f3ef38c411cd8307071ec922b9de162f8b2ca43fe9420cffd8a745045903

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,445 on Chainz ↗
Circulating Supply:58,002,491 XPM·at block #6,844,759 · 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