Home/Chain Registry/Block #3,503,563

Block #3,503,563

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 1/7/2020, 7:27:43 AM · Difficulty 10.9308 · 3,339,835 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
eb5f0f052d97dcbe81babd6cf483971b89813321c23f67196a8321d8f7420b5f

Difficulty

10.930835

Transactions

11

Size

72.93 KB

Version

2

Bits

0aee4b34

Nonce

1,351,447,409

Timestamp

1/7/2020, 7:27:43 AM

Confirmations

3,339,835

Merkle Root

f9ff65a348e72e7d6cd9ba8c1bc729bc2aefa90ada9eb006dae1664273fc078f
Transactions (11)
1 in → 1 out9.1600 XPM110 B
50 in → 1 out399.9200 XPM7.27 KB
50 in → 1 out399.9200 XPM7.27 KB
50 in → 1 out399.9200 XPM7.28 KB
50 in → 1 out399.9200 XPM7.27 KB
50 in → 1 out399.9200 XPM7.27 KB
50 in → 1 out399.9200 XPM7.27 KB
50 in → 1 out8542.2400 XPM7.27 KB
50 in → 1 out399.9200 XPM7.28 KB
50 in → 1 out399.9200 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.

6.005 × 10⁹⁴(95-digit number)
60055040604329165892…46504427348372383220
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
6.005 × 10⁹⁴(95-digit number)
60055040604329165892…46504427348372383219
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
6.005 × 10⁹⁴(95-digit number)
60055040604329165892…46504427348372383221
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.201 × 10⁹⁵(96-digit number)
12011008120865833178…93008854696744766439
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.201 × 10⁹⁵(96-digit number)
12011008120865833178…93008854696744766441
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.402 × 10⁹⁵(96-digit number)
24022016241731666357…86017709393489532879
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
2.402 × 10⁹⁵(96-digit number)
24022016241731666357…86017709393489532881
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.804 × 10⁹⁵(96-digit number)
48044032483463332714…72035418786979065759
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
4.804 × 10⁹⁵(96-digit number)
48044032483463332714…72035418786979065761
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.608 × 10⁹⁵(96-digit number)
96088064966926665428…44070837573958131519
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
9.608 × 10⁹⁵(96-digit number)
96088064966926665428…44070837573958131521
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.921 × 10⁹⁶(97-digit number)
19217612993385333085…88141675147916263039
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 3503563

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 eb5f0f052d97dcbe81babd6cf483971b89813321c23f67196a8321d8f7420b5f

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,503,563 on Chainz ↗
Circulating Supply:57,991,549 XPM·at block #6,843,397 · 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