Home/Chain Registry/Block #2,924,957

Block #2,924,957

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 11/16/2018, 4:49:47 AM · Difficulty 11.3560 · 3,915,805 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
2be76dfe34f746153b122d3a129a9e73eae8cd545560f9b397685973d16c4553

Difficulty

11.356031

Transactions

11

Size

72.88 KB

Version

2

Bits

0b5b24dc

Nonce

630,484,365

Timestamp

11/16/2018, 4:49:47 AM

Confirmations

3,915,805

Merkle Root

5c7047252687f68963a8e1ec3dcdbe252367f392415b4fd6c19bdcfde3e7b4fd
Transactions (11)
1 in → 1 out8.5400 XPM110 B
50 in → 1 out223.9102 XPM7.27 KB
50 in → 1 out225.8965 XPM7.26 KB
50 in → 1 out228.9361 XPM7.27 KB
50 in → 1 out230.1701 XPM7.27 KB
50 in → 1 out210.0146 XPM7.26 KB
50 in → 1 out235.6415 XPM7.27 KB
50 in → 1 out229.6645 XPM7.27 KB
50 in → 1 out201.7834 XPM7.27 KB
50 in → 1 out217.8116 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.

8.581 × 10⁹⁶(97-digit number)
85812963856444320919…64045333041972080640
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
8.581 × 10⁹⁶(97-digit number)
85812963856444320919…64045333041972080639
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
8.581 × 10⁹⁶(97-digit number)
85812963856444320919…64045333041972080641
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.716 × 10⁹⁷(98-digit number)
17162592771288864183…28090666083944161279
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.716 × 10⁹⁷(98-digit number)
17162592771288864183…28090666083944161281
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
3.432 × 10⁹⁷(98-digit number)
34325185542577728367…56181332167888322559
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
3.432 × 10⁹⁷(98-digit number)
34325185542577728367…56181332167888322561
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
6.865 × 10⁹⁷(98-digit number)
68650371085155456735…12362664335776645119
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
6.865 × 10⁹⁷(98-digit number)
68650371085155456735…12362664335776645121
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.373 × 10⁹⁸(99-digit number)
13730074217031091347…24725328671553290239
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.373 × 10⁹⁸(99-digit number)
13730074217031091347…24725328671553290241
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.746 × 10⁹⁸(99-digit number)
27460148434062182694…49450657343106580479
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 2924957

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 2be76dfe34f746153b122d3a129a9e73eae8cd545560f9b397685973d16c4553

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,924,957 on Chainz ↗
Circulating Supply:57,970,438 XPM·at block #6,840,761 · 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