1. #6,845,649TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Home/Chain Registry/Block #3,506,037

Block #3,506,037

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 1/9/2020, 1:26:25 AM · Difficulty 10.9303 · 3,339,613 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
8f5f316d988537f260d1c6855282ed4b13396632232bba4a981d7bcfc1e0d736

Difficulty

10.930286

Transactions

11

Size

60.37 KB

Version

2

Bits

0aee2738

Nonce

197,028,277

Timestamp

1/9/2020, 1:26:25 AM

Confirmations

3,339,613

Merkle Root

1a404fbb18ffa41129c7a9f4fcc91ff19793754218d124a0dafc241d339ca783
Transactions (11)
1 in → 1 out9.0300 XPM110 B
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 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.602 × 10⁹⁸(99-digit number)
56021530188753268429…02832070394449428480
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.602 × 10⁹⁸(99-digit number)
56021530188753268429…02832070394449428479
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
5.602 × 10⁹⁸(99-digit number)
56021530188753268429…02832070394449428481
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.120 × 10⁹⁹(100-digit number)
11204306037750653685…05664140788898856959
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.120 × 10⁹⁹(100-digit number)
11204306037750653685…05664140788898856961
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.240 × 10⁹⁹(100-digit number)
22408612075501307371…11328281577797713919
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
2.240 × 10⁹⁹(100-digit number)
22408612075501307371…11328281577797713921
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.481 × 10⁹⁹(100-digit number)
44817224151002614743…22656563155595427839
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
4.481 × 10⁹⁹(100-digit number)
44817224151002614743…22656563155595427841
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.963 × 10⁹⁹(100-digit number)
89634448302005229487…45313126311190855679
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
8.963 × 10⁹⁹(100-digit number)
89634448302005229487…45313126311190855681
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.792 × 10¹⁰⁰(101-digit number)
17926889660401045897…90626252622381711359
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 3506037

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 8f5f316d988537f260d1c6855282ed4b13396632232bba4a981d7bcfc1e0d736

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 #3,506,037 on Chainz ↗
Circulating Supply:58,009,649 XPM·at block #6,845,649 · 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