Block #3,504,908

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 1/8/2020, 6:09:30 AM · Difficulty 10.9307 · 3,328,306 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
8f21ebb7358c84bd4e80e8beb3dd6013c2b969e62a4e0e634dad3c05f83569e9

Height

#3,504,908

Difficulty

10.930689

Transactions

21

Size

145.60 KB

Version

2

Bits

0aee41a0

Nonce

359,596,571

Timestamp

1/8/2020, 6:09:30 AM

Confirmations

3,328,306

Merkle Root

481dc1781bed77ac473d1c33fe7bdb667bc6d4f8fe567583191d51ed77aea41a
Transactions (21)
1 in → 1 out9.9600 XPM110 B
50 in → 1 out199.9200 XPM7.27 KB
50 in → 1 out199.9200 XPM7.26 KB
50 in → 1 out199.9200 XPM7.26 KB
50 in → 1 out199.9200 XPM7.26 KB
50 in → 1 out199.9200 XPM7.26 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.

1.530 × 10⁹⁶(97-digit number)
15302625387720829032…41045552184412870239
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.530 × 10⁹⁶(97-digit number)
15302625387720829032…41045552184412870239
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
1.530 × 10⁹⁶(97-digit number)
15302625387720829032…41045552184412870241
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.060 × 10⁹⁶(97-digit number)
30605250775441658064…82091104368825740479
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
3.060 × 10⁹⁶(97-digit number)
30605250775441658064…82091104368825740481
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.121 × 10⁹⁶(97-digit number)
61210501550883316129…64182208737651480959
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
6.121 × 10⁹⁶(97-digit number)
61210501550883316129…64182208737651480961
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.224 × 10⁹⁷(98-digit number)
12242100310176663225…28364417475302961919
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.224 × 10⁹⁷(98-digit number)
12242100310176663225…28364417475302961921
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.448 × 10⁹⁷(98-digit number)
24484200620353326451…56728834950605923839
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
2.448 × 10⁹⁷(98-digit number)
24484200620353326451…56728834950605923841
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.896 × 10⁹⁷(98-digit number)
48968401240706652903…13457669901211847679
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,909,898 XPM·at block #6,833,213 · 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