1. #6,844,532TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

  2. #6,844,531TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #2,832,911

TWNLength 12★★★★☆

Bi-Twin Chain · Discovered 9/10/2018, 9:25:28 AM · Difficulty 11.7153 · 4,011,622 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
a220cb5e2218adb7aacb67220edbbe5b881dd95fa7b70ff9a8411b3439ba40ff

Height

#2,832,911

Difficulty

11.715298

Transactions

7

Size

2.84 KB

Version

2

Bits

0bb71dbf

Nonce

939,275,981

Timestamp

9/10/2018, 9:25:28 AM

Confirmations

4,011,622

Merkle Root

fdb0c26687e6fb569eaa0415781ffbb0797e76617eebbbcf82925cf367c39e46
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.096 × 10⁹⁵(96-digit number)
80965437624552104904…34692813025763476479
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.096 × 10⁹⁵(96-digit number)
80965437624552104904…34692813025763476479
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
8.096 × 10⁹⁵(96-digit number)
80965437624552104904…34692813025763476481
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.619 × 10⁹⁶(97-digit number)
16193087524910420980…69385626051526952959
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.619 × 10⁹⁶(97-digit number)
16193087524910420980…69385626051526952961
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.238 × 10⁹⁶(97-digit number)
32386175049820841961…38771252103053905919
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
3.238 × 10⁹⁶(97-digit number)
32386175049820841961…38771252103053905921
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.477 × 10⁹⁶(97-digit number)
64772350099641683923…77542504206107811839
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
6.477 × 10⁹⁶(97-digit number)
64772350099641683923…77542504206107811841
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.295 × 10⁹⁷(98-digit number)
12954470019928336784…55085008412215623679
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.295 × 10⁹⁷(98-digit number)
12954470019928336784…55085008412215623681
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.590 × 10⁹⁷(98-digit number)
25908940039856673569…10170016824431247359
Verify on FactorDB ↗Wolfram Alpha ↗
2^5 × origin + 1
2.590 × 10⁹⁷(98-digit number)
25908940039856673569…10170016824431247361
Verify on FactorDB ↗Wolfram Alpha ↗
Difference: 2^5 × origin + 1 − 2^5 × origin − 1 = 2 (twin primes ✓)

What this block proved

The miner who found this block proved the existence of 12 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
ExceptionalChain length 12

Around 1 in 10,000 blocks. A significant mathematical achievement.

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,000,666 XPM·at block #6,844,532 · 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