Block #3,234,141

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 6/21/2019, 3:27:40 AM · Difficulty 10.9960 · 3,610,703 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
0ab79770d760335d47c9f6fa365d41cff3b51b354071b5cfae794f95a113089c

Height

#3,234,141

Difficulty

10.996023

Transactions

7

Size

2.08 KB

Version

2

Bits

0afefb5f

Nonce

2,001,299,377

Timestamp

6/21/2019, 3:27:40 AM

Confirmations

3,610,703

Merkle Root

c7877be3f90dd6787e1695af543071d665c6bb47382aa344bef2073e2eba3c59
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.

2.010 × 10⁹⁵(96-digit number)
20105846458408076796…07586804656305164799
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
2.010 × 10⁹⁵(96-digit number)
20105846458408076796…07586804656305164799
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
2.010 × 10⁹⁵(96-digit number)
20105846458408076796…07586804656305164801
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
4.021 × 10⁹⁵(96-digit number)
40211692916816153593…15173609312610329599
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
4.021 × 10⁹⁵(96-digit number)
40211692916816153593…15173609312610329601
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
8.042 × 10⁹⁵(96-digit number)
80423385833632307187…30347218625220659199
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
8.042 × 10⁹⁵(96-digit number)
80423385833632307187…30347218625220659201
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.608 × 10⁹⁶(97-digit number)
16084677166726461437…60694437250441318399
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
1.608 × 10⁹⁶(97-digit number)
16084677166726461437…60694437250441318401
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
3.216 × 10⁹⁶(97-digit number)
32169354333452922875…21388874500882636799
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
3.216 × 10⁹⁶(97-digit number)
32169354333452922875…21388874500882636801
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
6.433 × 10⁹⁶(97-digit number)
64338708666905845750…42777749001765273599
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:58,003,161 XPM·at block #6,844,843 · 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