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

Block #2,925,382

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 11/16/2018, 12:08:48 PM · Difficulty 11.3541 · 3,915,150 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
9482bb6259a6093916704996e48668d2da2180b3c675e83f160e1d1808c0f51b

Difficulty

11.354148

Transactions

9

Size

58.35 KB

Version

2

Bits

0b5aa977

Nonce

1,944,301,082

Timestamp

11/16/2018, 12:08:48 PM

Confirmations

3,915,150

Merkle Root

af70e8b9787327204014ebd004e1ab90b5eb1d84a8ca6c7631a62bc14207cdc0
Transactions (9)
1 in → 1 out8.3800 XPM110 B
50 in → 1 out233.0826 XPM7.26 KB
50 in → 1 out221.9661 XPM7.26 KB
50 in → 1 out248.2359 XPM7.27 KB
50 in → 1 out235.7440 XPM7.28 KB
50 in → 1 out233.1553 XPM7.26 KB
50 in → 1 out221.2889 XPM7.27 KB
50 in → 1 out220.1630 XPM7.27 KB
50 in → 1 out234.2066 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.

5.631 × 10⁹⁴(95-digit number)
56314398825519153979…94870954123899232000
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.631 × 10⁹⁴(95-digit number)
56314398825519153979…94870954123899231999
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
5.631 × 10⁹⁴(95-digit number)
56314398825519153979…94870954123899232001
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.126 × 10⁹⁵(96-digit number)
11262879765103830795…89741908247798463999
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.126 × 10⁹⁵(96-digit number)
11262879765103830795…89741908247798464001
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.252 × 10⁹⁵(96-digit number)
22525759530207661591…79483816495596927999
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
2.252 × 10⁹⁵(96-digit number)
22525759530207661591…79483816495596928001
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.505 × 10⁹⁵(96-digit number)
45051519060415323183…58967632991193855999
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
4.505 × 10⁹⁵(96-digit number)
45051519060415323183…58967632991193856001
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
9.010 × 10⁹⁵(96-digit number)
90103038120830646366…17935265982387711999
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
9.010 × 10⁹⁵(96-digit number)
90103038120830646366…17935265982387712001
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.802 × 10⁹⁶(97-digit number)
18020607624166129273…35870531964775423999
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 2925382

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 9482bb6259a6093916704996e48668d2da2180b3c675e83f160e1d1808c0f51b

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,382 on Chainz ↗
Circulating Supply:57,968,587 XPM·at block #6,840,531 · 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