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

Block #3,506,073

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 1/9/2020, 1:56:08 AM · Difficulty 10.9304 · 3,335,717 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
2f80f4fa45e630bb0b21c2dbadfeeaacb21c05a397dd3349ef2ef06d4d83d71a

Difficulty

10.930377

Transactions

11

Size

72.89 KB

Version

2

Bits

0aee2d30

Nonce

1,564,751,930

Timestamp

1/9/2020, 1:56:08 AM

Confirmations

3,335,717

Merkle Root

e107b9cc63e9bfa5c9ba6ebc6e1000637b48074708d0a7d8b126b12d0b3686e0
Transactions (11)
1 in → 1 out9.1600 XPM109 B
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.26 KB
50 in → 1 out199.9200 XPM7.28 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out4118.3765 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.531 × 10⁹⁷(98-digit number)
55311506078281064449…68068601575248363520
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.531 × 10⁹⁷(98-digit number)
55311506078281064449…68068601575248363519
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
5.531 × 10⁹⁷(98-digit number)
55311506078281064449…68068601575248363521
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.106 × 10⁹⁸(99-digit number)
11062301215656212889…36137203150496727039
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.106 × 10⁹⁸(99-digit number)
11062301215656212889…36137203150496727041
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.212 × 10⁹⁸(99-digit number)
22124602431312425779…72274406300993454079
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
2.212 × 10⁹⁸(99-digit number)
22124602431312425779…72274406300993454081
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.424 × 10⁹⁸(99-digit number)
44249204862624851559…44548812601986908159
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
4.424 × 10⁹⁸(99-digit number)
44249204862624851559…44548812601986908161
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.849 × 10⁹⁸(99-digit number)
88498409725249703118…89097625203973816319
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
8.849 × 10⁹⁸(99-digit number)
88498409725249703118…89097625203973816321
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.769 × 10⁹⁹(100-digit number)
17699681945049940623…78195250407947632639
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 3506073

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

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,073 on Chainz ↗
Circulating Supply:57,978,698 XPM·at block #6,841,789 · 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