Block #3,503,559

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 1/7/2020, 7:21:48 AM · Difficulty 10.9309 · 3,333,502 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
dcf248f15fae65b40fdc2424ab3695aafa304fbbd3d2a70255e1a7e8d2794e5c

Height

#3,503,559

Difficulty

10.930860

Transactions

11

Size

72.89 KB

Version

2

Bits

0aee4cdb

Nonce

275,463,174

Timestamp

1/7/2020, 7:21:48 AM

Confirmations

3,333,502

Merkle Root

68a650a599d69e0e680c8e840c5de26499bbd7636918832cd6f1de839b25fcb4
Transactions (11)
1 in → 1 out9.1600 XPM110 B
50 in → 1 out399.9200 XPM7.26 KB
50 in → 1 out399.9200 XPM7.26 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 out399.9200 XPM7.27 KB
50 in → 1 out399.9200 XPM7.27 KB
50 in → 1 out4319.1200 XPM7.27 KB
50 in → 1 out399.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.

8.725 × 10⁹³(94-digit number)
87257424378659397816…24999828706672133679
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.725 × 10⁹³(94-digit number)
87257424378659397816…24999828706672133679
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
8.725 × 10⁹³(94-digit number)
87257424378659397816…24999828706672133681
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.745 × 10⁹⁴(95-digit number)
17451484875731879563…49999657413344267359
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.745 × 10⁹⁴(95-digit number)
17451484875731879563…49999657413344267361
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.490 × 10⁹⁴(95-digit number)
34902969751463759126…99999314826688534719
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
3.490 × 10⁹⁴(95-digit number)
34902969751463759126…99999314826688534721
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.980 × 10⁹⁴(95-digit number)
69805939502927518252…99998629653377069439
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
6.980 × 10⁹⁴(95-digit number)
69805939502927518252…99998629653377069441
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.396 × 10⁹⁵(96-digit number)
13961187900585503650…99997259306754138879
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.396 × 10⁹⁵(96-digit number)
13961187900585503650…99997259306754138881
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.792 × 10⁹⁵(96-digit number)
27922375801171007301…99994518613508277759
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.

★★★☆☆
Rarity
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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
Circulating Supply:57,940,791 XPM·at block #6,837,060 · 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