Block #443,871

TWNLength 11★★★☆☆

Bi-Twin Chain · Discovered 3/14/2014, 8:48:01 PM · Difficulty 10.3448 · 6,351,316 confirmations

TWN
Bi-Twin Chain

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

Block Header
Block Hash
8f45d4d4a45ba01e8cb44695fd01f21d5e15b8eeffd7fae3f32a8dd1697b52fb

Height

#443,871

Difficulty

10.344794

Transactions

7

Size

1.73 KB

Version

2

Bits

0a584471

Nonce

53,300,563

Timestamp

3/14/2014, 8:48:01 PM

Confirmations

6,351,316

Merkle Root

135f0d21a64ec07ce2797a50ada472215167297141bd1b305dbaa5095e0bfa90
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.

9.465 × 10⁹⁸(99-digit number)
94652445311887935434…54273550002947686399
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
9.465 × 10⁹⁸(99-digit number)
94652445311887935434…54273550002947686399
Verify on FactorDB ↗Wolfram Alpha ↗
origin + 1
9.465 × 10⁹⁸(99-digit number)
94652445311887935434…54273550002947686401
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.893 × 10⁹⁹(100-digit number)
18930489062377587086…08547100005895372799
Verify on FactorDB ↗Wolfram Alpha ↗
2^1 × origin + 1
1.893 × 10⁹⁹(100-digit number)
18930489062377587086…08547100005895372801
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.786 × 10⁹⁹(100-digit number)
37860978124755174173…17094200011790745599
Verify on FactorDB ↗Wolfram Alpha ↗
2^2 × origin + 1
3.786 × 10⁹⁹(100-digit number)
37860978124755174173…17094200011790745601
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
7.572 × 10⁹⁹(100-digit number)
75721956249510348347…34188400023581491199
Verify on FactorDB ↗Wolfram Alpha ↗
2^3 × origin + 1
7.572 × 10⁹⁹(100-digit number)
75721956249510348347…34188400023581491201
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.514 × 10¹⁰⁰(101-digit number)
15144391249902069669…68376800047162982399
Verify on FactorDB ↗Wolfram Alpha ↗
2^4 × origin + 1
1.514 × 10¹⁰⁰(101-digit number)
15144391249902069669…68376800047162982401
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
3.028 × 10¹⁰⁰(101-digit number)
30288782499804139339…36753600094325964799
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,605,543 XPM·at block #6,795,186 · 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.