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

Block #2,925,383

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 11/16/2018, 12:14:25 PM · Difficulty 11.3541 · 3,914,317 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
39f6054ea239805bc28daf01e2dead27aabaaeb1234d1c44b7c37253bea01fe3

Difficulty

11.354104

Transactions

13

Size

74.82 KB

Version

2

Bits

0b5aa687

Nonce

1,262,167,449

Timestamp

11/16/2018, 12:14:25 PM

Confirmations

3,914,317

Merkle Root

659978614b388db101058c5f9b6916af22d0429d2151a2a1a811f8c3cfeda439
Transactions (13)
1 in → 1 out8.5700 XPM109 B
50 in → 1 out243.4650 XPM7.27 KB
50 in → 1 out241.8956 XPM7.26 KB
50 in → 1 out221.4076 XPM7.27 KB
50 in → 1 out220.6067 XPM7.27 KB
50 in → 1 out228.4055 XPM7.26 KB
50 in → 1 out224.5134 XPM7.26 KB
50 in → 1 out198.4207 XPM7.26 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.294 × 10⁹³(94-digit number)
72944586861232186287…77435352291162529260
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
7.294 × 10⁹³(94-digit number)
72944586861232186287…77435352291162529259
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
7.294 × 10⁹³(94-digit number)
72944586861232186287…77435352291162529261
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.458 × 10⁹⁴(95-digit number)
14588917372246437257…54870704582325058519
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.458 × 10⁹⁴(95-digit number)
14588917372246437257…54870704582325058521
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.917 × 10⁹⁴(95-digit number)
29177834744492874514…09741409164650117039
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
2.917 × 10⁹⁴(95-digit number)
29177834744492874514…09741409164650117041
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
5.835 × 10⁹⁴(95-digit number)
58355669488985749029…19482818329300234079
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
5.835 × 10⁹⁴(95-digit number)
58355669488985749029…19482818329300234081
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
1.167 × 10⁹⁵(96-digit number)
11671133897797149805…38965636658600468159
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.167 × 10⁹⁵(96-digit number)
11671133897797149805…38965636658600468161
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
2.334 × 10⁹⁵(96-digit number)
23342267795594299611…77931273317200936319
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 2925383

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 39f6054ea239805bc28daf01e2dead27aabaaeb1234d1c44b7c37253bea01fe3

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,383 on Chainz ↗
Circulating Supply:57,961,888 XPM·at block #6,839,699 · 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