Block #2,925,525

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 11/16/2018, 2:39:42 PM · Difficulty 11.3532 · 3,917,594 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
4dcf76f7fc2c937259ae2959c841daea7ad82ac0df53b0421f6758287ff9296b

Height

#2,925,525

Difficulty

11.353237

Transactions

11

Size

72.89 KB

Version

2

Bits

0b5a6dc5

Nonce

15,208,741

Timestamp

11/16/2018, 2:39:42 PM

Confirmations

3,917,594

Merkle Root

d9e6d051989650d5a04d1c552f92ee3d40ad39c10ba59f239e8da9354cebf43a
Transactions (11)
1 in → 1 out8.5500 XPM110 B
50 in → 1 out220.8407 XPM7.27 KB
50 in → 1 out230.4172 XPM7.27 KB
50 in → 1 out219.5869 XPM7.26 KB
50 in → 1 out219.8982 XPM7.26 KB
50 in → 1 out222.6641 XPM7.26 KB
50 in → 1 out240.3826 XPM7.27 KB
50 in → 1 out214.5633 XPM7.27 KB
50 in → 1 out221.2260 XPM7.27 KB
50 in → 1 out226.1715 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.

1.534 × 10⁹⁵(96-digit number)
15347895709109047242…87452358492679568639
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
1.534 × 10⁹⁵(96-digit number)
15347895709109047242…87452358492679568639
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.534 × 10⁹⁵(96-digit number)
15347895709109047242…87452358492679568641
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
3.069 × 10⁹⁵(96-digit number)
30695791418218094485…74904716985359137279
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
3.069 × 10⁹⁵(96-digit number)
30695791418218094485…74904716985359137281
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
6.139 × 10⁹⁵(96-digit number)
61391582836436188971…49809433970718274559
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
6.139 × 10⁹⁵(96-digit number)
61391582836436188971…49809433970718274561
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
1.227 × 10⁹⁶(97-digit number)
12278316567287237794…99618867941436549119
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.227 × 10⁹⁶(97-digit number)
12278316567287237794…99618867941436549121
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
2.455 × 10⁹⁶(97-digit number)
24556633134574475588…99237735882873098239
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
2.455 × 10⁹⁶(97-digit number)
24556633134574475588…99237735882873098241
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
4.911 × 10⁹⁶(97-digit number)
49113266269148951177…98475471765746196479
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,989,318 XPM·at block #6,843,118 · 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